Super Jumping! Jumping! Jumping!

  HDU - 1087 

过于简单懒得说了

#include <cstdio> 
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX = 1000;
int a[MAX];
int dp[MAX];
main(){int N;while(scanf("%d",&N) != EOF && N){for(int i = 0;i < N;i++){scanf("%d",&a[i]);}int ans = 0;for(int i = 0;i < N;i++){dp[i] = a[i];for(int j = 0;j < i;j++){if(a[i] > a[j])dp[i] = max(dp[i],dp[j] + a[i]);}ans = max(ans,dp[i]);}printf("%d\n",ans);}return 0;
}