[acm/icpc2016ChinaFinal][CodeforcesGym101194] Mr. Panda and Strips 暴力+剪枝

神棍剪枝剪过去

#include <iostream>
#include <cstdio>
#include <cstring>

#define N 1050

using namespace std;
int F[100*N],a[N],v[N],tr[N],n,ans;
inline int rd() { int r; scanf("%d",&r); return r; }
inline void ut(int &x,int y) { x = max(x,y); }
inline void reset() { for (int i=1;i<=n;i++) F[a[i]]=0; }
inline int check(int x,int lhr) {
	int w=-(1<<30),l=x,r=x;
	while (r<=n) {
		while (!F[a[r]] && r<=n) F[a[r++]] = 1;
		if (tr[l] < lhr) break;
		ut(w,r-l);
		while ( F[a[r]] && l<=r) F[a[l++]] = 0;
	}
	for (int i=l;i<r;i++) F[a[i]] = 0;
	return w;
}

inline void solve() {
	memset(tr,0,sizeof(tr));
	memset(v,0,sizeof(v));
	memset(a,0,sizeof(a));
	ans = n = 0;
	
	n=rd();
	for (int i=1;i<=n;i++) a[i]=rd();
	for (int i=1;i<=n;i++,reset()) 
		for (int j=i;j<=n&&(!F[a[j]]);j++) v[i] = j , F[a[j]]++;
	for (int i=n;i>=1;i--) tr[i] = max(tr[i+1],v[i]-i+1);
	
	ans = tr[1];
	for (int i=1;i<=n;i++,reset()) 
		for (int j=i;j<=v[i];j++) {
			F[a[j]]++;
			if (ans >= j-i+1+tr[j+1]) continue;
			int t=check(j+1,ans-(j-i+1));
			ut(ans,j-i+1+t);
		} 
	reset();
}

int main() {
	int T=rd();
	for (int i=1;i<=T;i++) { solve(); printf("Case #%d: %d\n",i,ans); }
	return 0;
}