Lightoj 1148 - Mad Counting （暴力分块）

1148 - Mad Counting
PDF (English) Statistics Forum
Time Limit: 0.5 second(s) Memory Limit: 32 MB
Mob was hijacked by the mayor of the Town "TruthTown". Mayor wants Mob to count the total population of the town. Now the naive approach to this problem will be counting people one by one. But as we all know Mob is a bit lazy, so he is finding some other approach so that the time will be minimized. Suddenly he found a poll result of that town where N people were asked "How many people in this town other than yourself support the same team as you in the FIFA world CUP 2010?" Now Mob wants to know if he can find the minimum possible population of the town from this statistics. Note that no people were asked the question more than once.

Input
Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with an integer N (1 ≤ N ≤ 50). The next line will contain N integers denoting the replies (0 to 106) of the people.

Output
For each case, print the case number and the minimum possible population of the town.

Sample Input
Output for Sample Input
2
4
1 1 2 2
1
0
Case 1: 5

Case 2: 1

题目大意：查人数，每个人说出和自己一伙的有多少人，然后求这个城镇最少有多少人

思路：直接暴力，a[k][1]保存人数为k+1的一伙所出现的人的剩余量，a[k][0]保存k+1个人为一伙的人的总数，然后遍历一遍就行了，

注意：k个人一伙的情况可能会有多个

ac代码：

#include<stdio.h>
#include<string.h>
#define MAXN  1000010
int a[MAXN][3];
int MAX(int a,int b)
{
	return a>b?a:b;
}
int main()
{
	int t,i,n,k,M;
	int cas=0;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		memset(a,0,sizeof(a));
		for(i=0;i<n;i++)
		{
			scanf("%d",&k);
			if(a[k][1]==0)
			a[k][1]=k,a[k][0]+=(k+1);
			else
			a[k][1]--;
		}
		int sum=0;
		for(i=0;i<k+10;i++)
		{
			if(a[i][0])
			{
				sum+=a[i][0];
			}
		}
		printf("Case %d: %d\n",++cas,sum);
	}
	return 0;
}