zoukankan      html  css  js  c++  java
  • HDU1029:Ignatius and the Princess IV(找出数组中出现次数超过一半的数字)

    HDU1029:Ignatius and the Princess IV

    kuangbin专题12基础dp:B题

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K (Java/Others)
    Total Submission(s): 35107    Accepted Submission(s): 15340


    Problem Description
    "OK, you are not too bad, em... But you can never pass the next test." feng5166 says.

    "I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.

    "But what is the characteristic of the special integer?" Ignatius asks.

    "The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.

    Can you find the special integer for Ignatius?
     
    Input
    The input contains several test cases. Each test case contains two lines. The first line consists of an odd integer N(1<=N<=999999) which indicate the number of the integers feng5166 will tell our hero. The second line contains the N integers. The input is terminated by the end of file.
     
    Output
    For each test case, you have to output only one line which contains the special number you have found.
     
    Sample Input
    5 1 3 2 3 3 11 1 1 1 1 1 5 5 5 5 5 5 7 1 1 1 1 1 1 1
     
    Sample Output
    3 5 1
     
    题意:给奇数各数字  , 一定会有一个数字出现的次数 超过一半 , 问这个数字是哪一个
    思路:相同的数字个数 永远大于 不相同的数字的总和  所以遇到相同数字 sum ++ 不同的数字 sum-- sum==0 时 更改数字 
       最后留下来的数字 一定是 出现次数最多的那个 
      /*
    s.主元素即在数列中出现次数多于n/2的元素

    我们很容易的看出来,在一个序列中如果去掉2个不同的元素,
    那么原序列中的多元素,在新的序列中还是多元素,
    因此我们只要按照序列依次扫描,先把t赋值给result,
    增加个计数器,cnt = 1;然后向右扫描,
    如果跟result相同,则cnt++,不同,那么cnt --,
    这个真是我们从上面那个结论里得出的,一旦cnt == 0了,
    那么必定c不是多元素,这个时候把t赋值为result,cnt = 1;,
    重复该过程,知道结束,这个时候,result就是多元素,
    这个的时间复杂度为n,该题本来可以用数组保存每个元素,
    然后递归上述过程,可是,用数组超内存,
    因此我们可以直接按照上述过程计算
      */
    #include <cstdio>
    #include <iostream>
    #include <algorithm>
    using namespace std ; 
    
    int main(){
        int n ; 
        int sum ; 
        int num ;
        int new_num  ;  
        while(~scanf("%d" , &n)){
            
            for(int i=1 ; i<=n ; i++){
                scanf("%d" , &num) ; 
                if(i==1){ 
                    new_num = num ; 
                    sum = 1; 
                }
                if(num == new_num){
                    sum ++ ; 
                } else if(sum > 0 ){
                    sum -- ; 
                } else if(sum == 0 ){
                    new_num = num ; 
                }
            }
            printf("%d
    " , new_num) ; 
        } 
        return 0 ; 
    } 
  • 相关阅读:
    ESRI的地图控件和DEV控件存在冲突,造成调试中断无法通过
    使用Flex读取操作Excel文档的组件(开源组件)
    Flex 使用FileReference遇到的问题(未解决)
    Flex 学习站点汇总
    Puppet文档:模块基础
    Python实现ssh批量登录并执行命令【转】
    OpenDNS打造自由干净的网络环境【转】
    LAMP实验三:远程连接MySQL
    Puppet效果图【转]
    国内外DNS服务器地址列表【转】
  • 原文地址:https://www.cnblogs.com/yi-ye-zhi-qiu/p/7653322.html
Copyright © 2011-2022 走看看