HDU2192建房子
来源:互联网 发布:c语言打印双层金字塔 编辑:程序博客网 时间:2024/06/09 17:29
MagicBuilding
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1976 Accepted Submission(s): 887
Problem Description
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.
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.
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
212 51 2 2 3 3
Sample Output
12大体是建房子,间距为n,如果相同的高度,就合在一起#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <set>using namespace std;int main(){ int n,a[10001],i,j,m,sum; scanf("%d",&n); while(n--) { scanf("%d",&m); for(i=0; i<m; i++) { scanf("%d",&a[i]); } sum=0; for(i=0; i<m; i++) { int e=1; for(j=i+1; j<=m; j++) { if(a[i]==a[j]) e++; if(e>sum) sum=e; } } printf("%d\n",sum); } return 0;}
0 0
- HDU2192建房子
- 建房子
- 二维DP 建房子
- JavaScript趣题:建房子
- 用波音747飞机来……建房子
- HDU2192:MagicBuilding
- hdu2192 MagicBuilding
- 集资建房
- hdu2192(MagicBuilding 贪心)
- 自建房指导手册
- 2523: 建房工程
- oj2523: 建房工程
- OJ 2523: 建房工程
- 集炒房游资为建房资本
- 合作建房工作流程(图)
- 买房建房装修之风水知识,多图
- 大姐家坎坎坷坷的建房路
- [转]现代农村建房样板模式-----购不起房子就回家自己建房吧
- HDU 1196 Lowest Bit(基础题,有个小技巧)
- ubuntu 软件管理软件
- Android应用支持转移到SD卡
- ATS 概述
- Android Studio引用fresco编译问题的处理
- HDU2192建房子
- 网站SEO需要了解用户群体
- 2016/03/29
- MySQL入门篇
- UBUNTU的默认root密码是多少,修改root密码
- 什么是 Websphere Portal?
- iOS开发UI篇之tableView 的用法详解
- Vesions ignore & ld: library not found for -l..
- 网贷常见术语介绍