HDU 2192 MagicBuilding(贪心)

首先对size排序,然后随便弄弄就可以了

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <memory.h>
using namespace std;
const int maxn=10010;

int s[maxn],n;
bool vis[maxn];
int main(){
	int t;
	scanf("%d",&t);
	while (t--){
		scanf("%d",&n);
		for (int i=0;i<n;++i){
			scanf("%d",&s[i]);
		}
		memset(vis,0,sizeof(vis));
		sort(s,s+n);
		int ans=0;
		for (int i=0;i<n;++i){
			if(!vis[i]){
				ans++;
				int pre=s[i];
				for (int j=i+1;j<n;++j){
					if(s[j]>pre&&!vis[j]){
						vis[j]=1;
						pre=s[j];
					}
				}
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}