zoukankan      html  css  js  c++  java
  • hdoj 1049

     Ignatius and the Princess IV

    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

    AC代码,看到大佬说用dp,我感觉d不起来呀,dp的效果也是这种吧

     1 #include <bits/stdc++.h>
     2 
     3 using namespace std;
     4 
     5 int main(){
     6     int n;
     7     while(scanf("%d",&n)!=EOF){
     8         int t=0,ans,tmp;
     9         for (int i=0;i<n;i++){
    10             scanf("%d",&ans);
    11             if (t<=0) tmp=ans;
    12             ans==tmp? ++t:--t; 
    13         }
    14         printf("%d
    ",tmp);
    15     }
    16     
    17     return 0;
    18 }

    在python中也有一种写法,可惜,hdoj不支持python

     1 from collections import Counter
     2 
     3 while(True):
     4         try:
     5                 n=input()
     6                 ans=list(input().split())
     7                 res=Counter(ans)
     8                 for k in sorted(res, reverse=True):
     9                         print(k)
    10                         break
    11         except EOFError:
    12                 break
  • 相关阅读:
    童鞋,[HttpClient发送文件] 的技术实践请查收
    有关[Http持久连接]的一切,卷给你看
    浅谈MemoryCache的原生插值方式
    HTTP1.1 KeepAlive到底算不算长连接?
    C2 hits the assertion assert(base>is_AddP()) failed: should be addp but is Phi
    C2 EA
    OOM Hook
    C2 Loop predicate
    C2 Build IR
    C2 CCP
  • 原文地址:https://www.cnblogs.com/z-712/p/15059144.html
Copyright © 2011-2022 走看看