Ural 1635

我是题目

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<string>
#include<iostream>
using namespace std;

#define PB push_back
#define INS insert
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define nMax 4010
#define bug puts("Fuck");

bool can[nMax][nMax];
int dp[nMax],fa[nMax];
int n;
char s[nMax];

int main(){
//	freopen("input.txt","r",stdin);
//	freopen("output.txt","w",stdout);
	while(gets(s+1)){
	  //  cout<<s+1<<endl;
		memset(can,0,sizeof(can));
		dp[0] = 0;
		dp[1] = 1;
		fa[1] = 1;can[1][1] = can[2][2] = true;
		if(s[1] == s[2]) dp[2] = 1,fa[2] = 1,can[1][2] = true;
		else dp[2] = 2,fa[2] = 2;
		for(int i=3;s[i];i++) {
			dp[i] = dp[i-1] + 1;fa[i] = i;
			can[i][i] = true;
			for(int j=i-1;j>=1;j--){
				if(s[j] == s[i] && (j+1 == i || can[j+1][i-1]))  {
					if(dp[j-1] + 1 < dp[i]) {
						dp[i] = dp[j-1] + 1;
						fa[i] = j;
					}
					can[j][i] = true;
				}
			}
			//printf("dp[%d] = %d\n",i,dp[i]);
		}
		int l = strlen(s+1);
		printf("%d\n",dp[l]);
		vector<string> ans;
		ans.clear();
		for(int i=l;i>0;){
			string st="";
			for(int j=fa[i];j<=i;j++) st+=s[j];
			ans.PB(st);
			i = fa[i]-1;
		}
		for(int i=ans.size()-1;i>=0;i--) {
			if(i) printf("%s ",ans[i].c_str());
			else printf("%s\n",ans[i].c_str());
		}
	}
	return 0;
}