poj2176 Folding

Sample Input

Sample input #1
AAAAAAAAAABABABCCD

Sample input #2
NEERCYESYESYESNEERCYESYESYES

Sample Output

Sample output #1
9(A)3(AB)CCD

Sample output #2
2(NEERC3(YES))

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
char t[110];
class node
{
public:
	char s[110];
	int len;
}dp[110][110];
char ts[110];
void toString(int num)
{
    int L=0;
	while(num)
	{
		ts[L++]=num%10+'0';
		num/=10;
	}
	ts[L]='\0';
	for(int i=0;i<L/2;i++)//0,,,,L-1
	{
		char tt=ts[i];
		ts[i]=ts[L-1-i];
		ts[L-1-i]=tt;
	}
}
void calc(int i,int j)//t[i]...t[j]
{
	if(i==j)
	{
		dp[i][j].s[0]=t[i];
		dp[i][j].s[1]='\0';
		dp[i][j].len=1;
		return;
	}
	for(int k=1;k<j-i+1;k++)//k        
	{
		if((j-i+1)%k)
		{
			continue;
		}
		//t[i]...t[i+k-1]
		int p;
		for(p=i+k;p<=j;p++)
		{
			if(t[p]!=t[(p-i)%k+i])
			{
				break;
			}
		}
		if(p>j)//      （   ）   
		{
			if(dp[i][i+k-1].len==-1)
			{
				calc(i,i+k-1);
			}
			toString((j-i+1)/k);
			strcpy(dp[i][j].s,ts);
			dp[i][j].len=strlen(dp[i][j].s);
			dp[i][j].s[dp[i][j].len++]='(';
			for(int kk=0;kk<dp[i][i+k-1].len;kk++)
			{
				dp[i][j].s[dp[i][j].len++]=dp[i][i+k-1].s[kk];
			}
			dp[i][j].s[dp[i][j].len++]=')';
			dp[i][j].s[dp[i][j].len]='\0';
			break;
		}
	}
	for(int k=i;k<j;k++)//dp[i][k],dp[k+1][j]
	{
		if(dp[i][k].len==-1)
		{
			calc(i,k);
		}
		if(dp[k+1][j].len==-1)
		{
			calc(k+1,j);
		}
		if(dp[i][j].len==-1||dp[i][j].len>dp[i][k].len+dp[k+1][j].len)
		{
			strcpy(dp[i][j].s,dp[i][k].s);
			strcat(dp[i][j].s,dp[k+1][j].s);
			dp[i][j].len=strlen(dp[i][j].s);
			continue;
		}
		//if(dp[i][j].len==dp[i][k].len+dp[k+1][j].len)//      (╬▔ ▔) 
		//{
		//}
	}
}
int main()
{
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	while(~scanf("%s",t))
	{
		int lt=strlen(t);
		for(int i=0;i<lt;i++)
		{
			for(int j=i;j<lt;j++)
			{
				dp[i][j].len=-1;
			}
		}
		//dp[0][lt-1]
		calc(0,lt-1);
		printf("%s
",dp[0][lt-1].s);
	}
	return 0;
}