HDU 2192 MagicBuilding
来源:互联网 发布:adams2016软件卸载 编辑:程序博客网 时间:2024/05/19 21:44
http://acm.hdu.edu.cn/showproblem.php?pid=2192
MagicBuilding
TimeLimit: 1000/1000 MS(Java/Others)Total Submission(s):576
Problem Description
As the increase of population, theliving space for people is becoming smaller and smaller. InMagicStar the problem is much worse. Dr. Mathematica is trying tosave land by clustering buildings and then we call the set ofbuildings MagicBuilding. Now we can treat the buildings as a squareof size d, and the height doesn't matter. Buildings ofd1,d2,d3....dn can be clustered into one MagicBuilding if theysatisfy di != dj(i != j).
Given a series of buildings size , you need to calculate theminimal numbers of MagicBuildings that can be made. Note that onebuilding can also be considered as a MagicBuilding.
Suppose there are five buildings : 1, 2, 2, 3, 3. We make threeMagicBuildings (1,3), (2,3), (2) .And we can also make twoMagicBuilding :(1,2,3), (2,3). There is at least two MagicBuildingsobviously.
Given a series of buildings size , you need to calculate theminimal numbers of MagicBuildings that can be made. Note that onebuilding can also be considered as a MagicBuilding.
Suppose there are five buildings : 1, 2, 2, 3, 3. We make threeMagicBuildings (1,3), (2,3), (2) .And we can also make twoMagicBuilding :(1,2,3), (2,3). There is at least two MagicBuildingsobviously.
Input
The first line of the input is a singlenumber t, indicating the number of test cases.
Each test case starts by n (1≤n≤10^4) in a line indicating thenumber of buildings. Next n positive numbers (less than 2^31) willbe the size of the buildings.
Each test case starts by n (1≤n≤10^4) in a line indicating thenumber of buildings. Next n positive numbers (less than 2^31) willbe the size of the buildings.
Output
For each test case , output a numberperline, meaning the minimal number of the MagicBuilding that canbe made.
Sample Input
2 1 2 5 1 22 3 3
Sample Output
1 2
Author
scnu
Recommend
lcy
题意:给出一组数据,找出其中相同数字出现次数的最大值。
分析:感觉是一道简单题,我用哈希做得,一直是running time error实在是找不出问题。请帮忙看看,到底是哪里出错了。
代码如下:
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int haxi[10050];
int main()
{
int T,n,w,k,max,i;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
memset(haxi,0,sizeof(haxi));
max=0;
while(n--)
{
scanf("%d",&w);
haxi[w]++;
if(max<w)max=w;
}
max=max+1;
sort(haxi,haxi+max);
printf("%d\n",haxi[max-1]);
}
return0;
}
#include<algorithm>
#include<string.h>
using namespace std;
int haxi[10050];
int main()
{
}
最后只能换一种方法,哈希是用不了了。网上找到一个
http://hi.baidu.com/���ƻ���/blog/item/e5df48ee973fabdab31cb1ad.html
(其实我感觉使用哈希应该比他的巧妙一点点。。。^-^)
代码如下:
#include<iostream>
#include <algorithm>
using namespace std;
int main()
{
}
阅读全文
0 0
- HDU 2192 MagicBuilding
- HDU 2192 MagicBuilding
- HDU 2192 MagicBuilding(贪心)
- JAVA hdu 2192 MagicBuilding
- hdu 2192 MagicBuilding
- hdu---2192MagicBuilding
- hdu 2192 MagicBuilding
- HDU 1242 Rescue
- ZZULI_SummerPractice(3) HDU 1…
- HDU 1579 Function Run Fun
- HDU 1405 The Last Practice
- HDU 2050 折线分割平面
- hdu 1000 A + B Problem
- MagicBuilding 2192
- HDU 1075 What Are You Talking …
- HDOJ 1171 Big Event in HDU
- hdu 1216 Assistance Required
- hdu 1225 Football Score
- Sass学习笔记。
- HDU 2547 无剑无我
- HDU 2523 SORT AGAIN
- SIFT特征提取
- HDU 2401 Baskets of Gold Coins
- HDU 2192 MagicBuilding
- 我对JAVA面向对象的理解
- HDU 2161 Primes
- HDU 2156 分数矩阵
- iOS如何查看静态库.a文件是否支持i386?
- Androidstudio开发ARcore
- codeforces Balanced Substring
- HDU 2153 仙人球的残影
- HDU 2137 circumgyrate the string