Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int dp[SIZE][SIZE];
- int n;
- for(int i=0;i<n;i++){
- for(int j=0;j+i<n;j++){
- int ll=i,rr=i+j;
- for(int k=ll;k<=rr;k++){
- //do your transform here
- //such as dp[ll][rr]=max(dp[ll][rr],dp[ll][k],dp[k+1][rr]);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement