zoukankan      html  css  js  c++  java
  • Flying to the Mars

    Flying to the Mars

    Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 8799    Accepted Submission(s): 2879


    Problem Description

    In the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns . Finally , PPF decides to attack Kscinow who ruling the Mars . Here the problem comes! How can the soldiers reach the Mars ? PPF convokes his soldiers and asks for their suggestions . “Rush … ” one soldier answers. “Shut up ! Do I have to remind you that there isn’t any road to the Mars from here!” PPF replies. “Fly !” another answers. PPF smiles :“Clever guy ! Although we haven’t got wings , I can buy some magic broomsticks from HARRY POTTER to help you .” Now , it’s time to learn to fly on a broomstick ! we assume that one soldier has one level number indicating his degree. The soldier who has a higher level could teach the lower , that is to say the former’s level > the latter’s . But the lower can’t teach the higher. One soldier can have only one teacher at most , certainly , having no teacher is also legal. Similarly one soldier can have only one student at most while having no student is also possible. Teacher can teach his student on the same broomstick .Certainly , all the soldier must have practiced on the broomstick before they fly to the Mars! Magic broomstick is expensive !So , can you help PPF to calculate the minimum number of the broomstick needed .
    For example : 
    There are 5 soldiers (A B C D E)with level numbers : 2 4 5 6 4;
    One method :
    C could teach B; B could teach A; So , A B C are eligible to study on the same broomstick.
    D could teach E;So D E are eligible to study on the same broomstick;
    Using this method , we need 2 broomsticks.
    Another method:
    D could teach A; So A D are eligible to study on the same broomstick.
    C could teach B; So B C are eligible to study on the same broomstick.
    E with no teacher or student are eligible to study on one broomstick.
    Using the method ,we need 3 broomsticks.
    ……

    After checking up all possible method, we found that 2 is the minimum number of broomsticks needed. 
     
    Input
    Input file contains multiple test cases. 
    In a test case,the first line contains a single positive number N indicating the number of soldiers.(0<=N<=3000)
    Next N lines :There is only one nonnegative integer on each line , indicating the level number for each soldier.( less than 30 digits);
     
    Output
    For each case, output the minimum number of broomsticks on a single line.
     
    Sample Input
    4 10 20 30 04 5 2 3 4 3 4
     
    Sample Output
    1 2

    第一次用map,感觉map好强大啊!

    #include<cstdio>
    #include<map>
    using namespace std;

    int main()
    {
    int n,i,max,level;

    while(scanf("%d",&n)!=EOF)
    {
    map<int,int>mp;
    max=-1;
    for(i=0;i<n;i++)
    {
    scanf("%d",&level);
    mp[level]++;
    if(mp[level]>max)
    max=mp[level];
    }
    printf("%d ",max);
    }
    return 0;
    }

    世上无难事,只要肯登攀。
  • 相关阅读:
    php建立多层目录的函数
    PHP获取远程图片并调整图像大小(转)
    敏捷开发之每日站立会议
    没有所谓的人脉,只有更强的自己
    Linux上使用程序相对路径访问文件【转】
    视频图像处理基础知识1(双线性插值算法描述及实现)【转】
    视频图像处理基础知识4(视频分辨率参考 行频 隔行扫描 逐行扫描)【转】
    IPC网络高清摄像机基础知识4(Sensor信号输出YUV、RGB、RAW DATA、JPEG 4种方式区别) 【转】
    视频图像处理基础知识5(RGB与Ycbcr相互转换公式 )【转】
    视频图像处理基础知识0(双线性插值算法进行图像缩放)【转】
  • 原文地址:https://www.cnblogs.com/littlehoom/p/3423891.html
Copyright © 2011-2022 走看看