kuangbin专题十二 HDU1029 Ignatius and the Princess IV (水题)

Ignatius and the Princess IV

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


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
 
 
 

被专题的第一题吓到了,以为还是一道难题,就复杂考虑了。排序,然后

dp[i] = (a[i] == a[i-1]) ? dp[i-1] + 1 : 1

后来才发现必定有解,直接输出就可以了

 

 

复制代码
 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <math.h>
 4 #include <string.h>
 5 #include <stdlib.h>
 6 #include <string>
 7 #include <vector>
 8 #include <set>
 9 #include <map>
10 #include <queue>
11 #include <algorithm>
12 #include <sstream>
13 #include <stack>
14 using namespace std;
15 typedef long long ll;
16 const int inf = 0x3f3f3f3f;
17 const int maxn = 1000010;
18 int a[maxn];
19 int dp[maxn];
20 
21 int main() {
22     freopen("in.txt", "r", stdin);
23     int n;
24     while(~scanf("%d", &n)) { 
25         memset(dp, 0, sizeof(dp));
26         for(int i = 0; i < n; i++) {
27             scanf("%d", &a[i]);
28         }
29         if(n == 1) {//特判了一下
30             printf("%d\n", a[0]);
31             continue;
32         }
33         sort(a, a+n);
34         dp[0] = 1;
35         int maxdp = dp[0], pos = -1;
36         for(int i = 1; i < n; i++) {
37             dp[i] = (a[i] == a[i-1]) ? dp[i-1] + 1 : 1;
38             if(dp[i] > maxdp) {
39                 maxdp = dp[i];//最大值的dp,对应出现最多的数
40                 pos = i;
41             }
42         }
43         printf("%d\n", a[pos]);
44     }
45 }
复制代码

 


 

posted @   Frontierone  阅读(151)  评论(0编辑  收藏  举报
编辑推荐:
· Java 中堆内存和栈内存上的数据分布和特点
· 开发中对象命名的一点思考
· .NET Core内存结构体系(Windows环境)底层原理浅谈
· C# 深度学习:对抗生成网络(GAN)训练头像生成模型
· .NET 适配 HarmonyOS 进展
阅读排行:
· DeepSeek+PageAssist实现本地大模型联网
· 手把手教你更优雅的享受 DeepSeek
· 腾讯元宝接入 DeepSeek R1 模型,支持深度思考 + 联网搜索,好用不卡机!
· 从 14 秒到 1 秒:MySQL DDL 性能优化实战
· AI工具推荐:领先的开源 AI 代码助手——Continue
点击右上角即可分享
微信分享提示