分段上升子序列，二次DP （poj1239）（留坑待完善。。。）

dp经典题。思路是对的但要改一下数据存储方式。。因为80个字符表示的数字int放不下。。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#define maxn 100
using namespace std;
char a[maxn];
int len,last;
int bk[maxn];
int v[maxn][maxn],front[maxn];
void front_dp(){
int k;
front[1] = v[1][1];
for(int i = 2;i<=len;i++){
for(k = i;k>1;k--){
if(v[k][i]>front[k-1]){
front[i] = v[k][i];
break;
}
}
if(k == 1){
front[i] = v[1][i];
}
}
last = k;
}
void back_dp(){
bk[last] = len+1;
int pos = last-1;
while(pos&&a[pos] == '0'){
bk[pos] = bk[last];
pos--;
}
for(int i = pos;i>=1;i--){
int val = v[i][i],x = i+1;
for(int k = i+2;k<=last;k++){
if(v[i][k-1]<v[k][bk[k]-1] && v[i][k-1]>val){
val = v[i][k-1],x = k;
}
}
bk[i] = x;
}
}
void print_res(){
int cur = 1;
for(int i = bk[1];i!=len+1;i = bk[i]){
for(;cur<i;cur++){
printf("%c",a[cur]);
}
printf(",");
}
for(;cur<=len;cur++){
printf("%c",a[cur]);
}
printf("\n");

}
int main(){
while(~scanf("%s",a+1)){

if(!strcmp(a+1,"0")){
break;
}
len = strlen(a+1);
memset(v,0,sizeof(v));

for(int c = 0;c<len;c++){
for(int i = 1;i <= len-c;i++){
int j = i+c;
if(!strcmp(v[i][j-1],"0")){
v[i][j] = v[i][j-1] + a[j];
}
else{
v[i][j] = a[j];
}
}
}

front_dp();
back_dp();
print_res();
}

return 0;
}