HDOJ 4293 dp

Description

　　According to a research, VIM users tend to have shorter fingers, compared with Emacs users. 
　　Hence they prefer problems short, too. Here is a short one: 
　　Given n (1 <= n <= 10  ¹⁸), You should solve for 
g(g(g(n))) mod 10  ⁹ + 7
　　where 
g(n) = 3g(n - 1) + g(n - 2)
g(1) = 1
g(0) = 0

 

Input

　　There are several test cases. For each test case there is an integer n in a single line. 
　　Please process until EOF (End Of File). 

 

Output

　　For each test case, please print a single line with a integer, the corresponding answer to this case. 

 

Sample Input

       
       

        
         0
1
2 
       
       

 

Sample Output

       
       

        
         0
1
42837 
       
       

 

就是一个裸的dp

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int dp[503],sum[503][503],maxs,n,i,j,t1,t2,p,ans;
int main(){
    while (scanf("%d",&n)!=EOF){
        p=0;
        memset(dp,0,sizeof(dp));
        memset(sum,0,sizeof(sum));
        for (i=0;i<n;i++){
            scanf("%d%d",&t1,&t2);
            if (t1+t2+1<=n){
                p++;
                sum[t1+1][n-t2]++;
                if (sum[t1+1][n-t2]>n-t2-t1) sum[t1+1][n-t2]=n-t2-t1;
            }
        }
        ans=0;
        for (i=1;i<=n;i++){
            maxs = 0;
            dp[i] = dp[i-1];
            for (j = 0 ;j < i;j++){
                if (maxs<dp[j]+sum[j+1][i]) maxs= dp[j] + sum[j+1][i];
                if (ans<maxs) ans = maxs;
                }
            if (dp[i]<maxs) dp[i] = maxs;
        }
        printf("%d\n",ans);
    }
    return 0;
}