HDU 2192
来源:互联网 发布:软件设计师考试时间 编辑:程序博客网 时间:2024/06/10 20:43
MagicBuilding
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
As the increase of population, the living space for people is becoming smaller and smaller. In MagicStar the problem is much worse. Dr. Mathematica is trying to save land by clustering buildings and then we call the set of buildings MagicBuilding. Now we can treat the buildings as a square of size d, and the height doesn't matter. Buildings of d1,d2,d3....dn can be clustered into one MagicBuilding if they satisfy di != dj(i != j).
Given a series of buildings size , you need to calculate the minimal numbers of MagicBuildings that can be made. Note that one building can also be considered as a MagicBuilding.
Suppose there are five buildings : 1, 2, 2, 3, 3. We make three MagicBuildings (1,3), (2,3), (2) .And we can also make two MagicBuilding :(1,2,3), (2,3). There is at least two MagicBuildings obviously.
Input
The first line of the input is a single number t, indicating the number of test cases.
Each test case starts by n (1≤n≤10^4) in a line indicating the number of buildings. Next n positive numbers (less than 2^31) will be the size of the buildings.
Output
For each test case , output a number perline, meaning the minimal number of the MagicBuilding that can be made.
Sample Input
2
1
2
5
1 2 2 3 3
Sample Output
1
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1762 Accepted Submission(s): 778
As the increase of population, the living space for people is becoming smaller and smaller. In MagicStar the problem is much worse. Dr. Mathematica is trying to save land by clustering buildings and then we call the set of buildings MagicBuilding. Now we can treat the buildings as a square of size d, and the height doesn't matter. Buildings of d1,d2,d3....dn can be clustered into one MagicBuilding if they satisfy di != dj(i != j).
Given a series of buildings size , you need to calculate the minimal numbers of MagicBuildings that can be made. Note that one building can also be considered as a MagicBuilding.
Suppose there are five buildings : 1, 2, 2, 3, 3. We make three MagicBuildings (1,3), (2,3), (2) .And we can also make two MagicBuilding :(1,2,3), (2,3). There is at least two MagicBuildings obviously.
Input
The first line of the input is a single number t, indicating the number of test cases.
Each test case starts by n (1≤n≤10^4) in a line indicating the number of buildings. Next n positive numbers (less than 2^31) will be the size of the buildings.
Output
For each test case , output a number perline, meaning the minimal number of the MagicBuilding that can be made.
Sample Input
2
1
2
5
1 2 2 3 3
Sample Output
1
2
水题 求出现次数最多的
#include <stdio.h>#include <map>using namespace std;int main(){ int t; scanf("%d",&t); while(t--) { map <int,int>m; int n,b,t=0; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&b); m[b]++; if(t<m[b]) t=m[b]; } printf("%d\n",t); m.clear(); } return 0;}
0 0
- hdu 2192
- HDU 2192
- HDU 2192 MagicBuilding
- HDU 2192 MagicBuilding(贪心)
- JAVA hdu 2192 MagicBuilding
- hdu 2192 MagicBuilding
- hdu---2192MagicBuilding
- hdu 2192 MagicBuilding
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- Socket 和ServerSocket的连接 .单一的聊天,随便输入输出
- 面向Amazon S3的VPC Endpoint发布
- iOS-NSUserDefaults简单使用
- JSP九大内置对象和四个作用域
- Java删除文件夹--递归
- HDU 2192
- JAVA Threadlocal 的使用
- Socket和ServerSocket的连接,单一的聊天,随便输入输出.
- HDOJ 1010 Tempter of the Bone(dfs)
- Spring-SpringMVC-Hibernate在IntelliJ与Maven的环境下搭建
- js调用百度地图api实现定位
- 利用转义字符切换目录
- Convert Sorted List to Binary Search Tree
- 简单工厂、工厂方法、抽象工厂、策略模式、策略与工厂的区别