线性dp

OJ题目：click here~

题目分析：股票买卖。给股票价格。先买后卖，只能手持一股。求最大收益。

LL dp[1002][1002];
int main(){
    int i , j , n , m, k , x[1002] ;
    //freopen("in.txt" , "r" , stdin);
    while(scanf("%d%d",&n,&m) != EOF){
        for(i = 1;i <= n;i++)
            scanf("%d",&x[i]);
        memset(dp , 0 , sizeof(dp));
        LL mx = 0;
        for(j = 1;j <= m;j++){
            mx = dp[1][j - 1] - x[1];
            for(i = 1;i <= n;i++){
                dp[i][j] = max(dp[i - 1][j] , mx + x[i]);
                mx = max(mx , dp[i][j - 1] - x[i]);
            }
        }
        cout << dp[n][m]<<endl;
    }
}