zoukankan      html  css  js  c++  java
  • hdoj 1029

    Ignatius and the Princess IV

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


    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
     
    第一题弄了这么久,结果第二题来一道水题。。。自信又回来了????qwq
     1 #include<cstdio>
     2 #include<cstring>
     3 int a[1000006];
     4 
     5 int main()
     6 {
     7     int n;
     8     while( ~scanf("%d",&n)){
     9         memset( a, 0, sizeof a);
    10         int ans,x;
    11         for(int i=1;i<=n;i++){
    12             scanf("%d",&x);
    13             a[x]++;
    14             if(a[x]>=(n+1)/2) ans=x;
    15         }
    16         printf("%d
    ",ans);
    17     }
    18     return 0;
    19 }
     
  • 相关阅读:
    Spring Boot 7:配置文件信息读取
    Spring Boot 6:自定义filter
    Spring AOP:Java动态代理和CGlib
    Spring AOP:概念
    设计模式(二)---策略模式
    设计模式(一)--装饰模式
    java并发编程实战笔记
    剑指offer java -查找旋转数组的最小数字
    读书计划
    协议初学
  • 原文地址:https://www.cnblogs.com/ZQUACM-875180305/p/9077692.html
Copyright © 2011-2022 走看看