hdu 1087 枚举+DP

状态转移方程为b[i]=max(b[j]+a[i],b[i])   其中(a[j]<a[i],表示i可以从j跳过去)(0<=j<i)我觉得还可以优化

#include <iostream>using namespace std;int N;int a[1001];int b[1001];int DP(){int max = a[1];b[1] = a[1];for(int i = 2; i <= N; i++){b[i] = a[i];for(int j = 1; j < i; j++){if(a[i] > a[j]){if(b[j] + a[i] > b[i])b[i] = b[j] + a[i];}}if(b[i] > max)max = b[i];}return max;}int main(){while(cin>>N,N!=0){for(int i = 1; i <= N; i++){cin>>a[i];}int ans = DP();cout<<ans<<endl;}return 0;}