【DP】 HDOJ A simple greedy problem.

贪心预处理，然后DP求解。。。直接贪心是不行的。。因为有血量和补刀数两个限制，所以直接贪心就会乱掉。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1005
#define maxm 40005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

int num[maxn];
stack<int> s;
int dp[maxn][maxn];
int c[maxn];
int n, mx;

void init(void)
{
	while(!s.empty()) s.pop();
	memset(c, 0, sizeof c);
	memset(dp, 0, sizeof dp);
	memset(num, 0, sizeof num);
}
void read(void)
{
	int x;
	scanf("%d", &n), mx = 0;
	for(int i = 1; i <= n; i++) scanf("%d", &x), num[x]++, mx = max(x, mx);
}
void work(int _)
{
	for(int i = 1; i <= mx; i++) {
		if(num[i]) {
			c[i] = i;
			while(--num[i]) if((int)s.size() >= i - s.top()) c[s.top()] = i, s.pop();
		}
		else s.push(i);
	}
	int ans = 0;
	//for(int i = 1; i <= mx; i++) printf("%d : %d\n", i, c[i]);
	for(int i = 1; i <= mx; i++)
		for(int j = 0; j <= i; j++) {
			if(j > 0) dp[i][j] = dp[i-1][j-1];
			if(c[i] && j + c[i] - i < i) dp[i][j] = max(dp[i][j], dp[i-1][j + c[i] - i] + 1);
			//printf("%d %d :: %d %d\n", i, j, dp[i][j], c[i]);
		}
	for(int i = 0; i <= mx; i++) ans = max(ans, dp[mx][i]);
	printf("Case #%d: %d\n", _, ans);
}
int main(void)
{
	int _, __;
	while(scanf("%d", &_)!=EOF) {
		__ = 0;
		while(_--) {
			read();
			init();
			work(++__);
		}
	}
	return 0;
}