(动态规划)最大子序列的求解

#include
int main(){
    int n;
    scanf("%d",&n);//length
    int a[n];
    for(int i=0;idp[i]?Max:dp[i];
    }
    printf("%d",Max);
}