DP经典问题核心代码

//fibonacci
int dp[maxn];
int fibonacci(int n){
    for(int i = 0;i <= n;++i){
        if(i <= 1) dp[i] = i;
        else dp[i] = dp[i - 1] + dp[i - 2];
    }
    return dp[n];
}
//最大连续子序列和
int dp[maxn];
int arr[maxn];
void fun(int n){
    for(int i = 0;i < n;++i){
        if(i == 0) dp[i] = arr[0];
        else dp[i] = max(arr[i],arr[i] + dp[i]);
    }
}
int maxmium = 0;
for(int i = 0;i < n;++i){
    if(dp[i] > maxmium) maxmium = dp[i];
}
//最长递增子序列
int dp[maxn];
int arr[maxn];
void fun(int n){
    for(int i = 0;i < n;++i){
        if(i == 0) dp[i] = 1;
        else{
            dp[i] = 1;
            for(int j = 0;j < i;++j){
                if(arr[j] < arr[i]) dp[i] = max(dp[j] + 1,dp[i]);
            }
        }
    }
}
int maxmium = 1;
for(int i = 0;i < n;++i){
    if(dp[i] > maxmium) maxmium = dp[i];
}
//最长公共子序列
int dp[maxn][maxn];
char str1[maxn];//从下标1开始存
char str2[maxn];
void fun(int n,int m){
    for(int i = 0;i <= n;++i){
        for(int j = 0;j <= m;++j){
            if(i == 0 || j == 0) dp[i][j] = 0;
            else{
                if(str1[i] == str2[j]) dp[i][j] = dp[i - 1][j - 1] + 1;
                else dp[i][j] = max(dp[i - 1][j],dp[i][j - 1]);
            }
        }
    }
}