【DP】 csu 1620 A Cure for the Common Code

区间DP，转移用kmp求出最长循环子串。。。。

#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 505
#define maxm 10005
#define eps 1e-12
#define mod 998244353
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
//#define ls o<<1
//#define rs o<<1 | 1
//#define lson o<<1, L, mid 
//#define rson o<<1 | 1, mid+1, R
//#pragma comment(linker, "/STACK:102400000,102400000")
#define pii pair<int, int> 
typedef long long LL;
typedef unsigned long long ULL;
//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;}
// head

int f[maxn];
int dp[maxn][maxn];
char s[maxn];

void calc(int a, int b, char* p)
{
	int len = b - a + 1;
	dp[a][b] = min(dp[a][b], len);
	f[0] = 0, f[1] = 0;
	for(int i = 1; i < len; i++) {
		int j = f[i];
		while(j && p[i] != p[j]) j = f[j];
		f[i+1] = p[i] == p[j] ? j+1 : 0;
	}

	int rep = len - f[len];
	if(len % rep) return;
	int t = len / rep;
	if(t >= 100) t = 3;
	else if(t >= 10) t = 2;
	else t = 1;
	if(rep == 1) dp[a][b] = min(dp[a][b], t + dp[a][a+rep-1]);
	else dp[a][b] = min(dp[a][b], t + 2 + dp[a][a+rep-1]);
}

void work()
{
	int n = strlen(s+1);
	memset(dp, INF, sizeof dp);
	for(int j = 1; j <= n; j++)
		for(int i = j; i >= 1; i--) {
			calc(i, j, s+i);
			for(int k = i; k < j; k++)
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j]);
		}
	printf("%d\n", dp[1][n]);
}

int main()
{
	int _ = 0;
	while(scanf("%s", s+1)!=EOF) {
		if(s[1] == '0') break;
		printf("Case %d: ", ++_);
		work();
	}
	
	
	return 0;
}