HDU 1087 - Super Jumping! Jumping! Jumping!

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, a[1005], Max, dp[1005];
while (scanf("%d", &n)!=EOF && n){
for (int i=0; i<n; i++){
scanf("%d", &a[i]);
dp[i] = a[i];
}
for (int i=0; i<n; i++)
for (int j=i+1; j<n; j++)
if (a[j] > a[i])
dp[j] = max(dp[j], dp[i]+a[j]);
Max = dp[0];
for (int i=1; i<n; i++)
Max = max(Max, dp[i]);
printf("%d\n", Max);
}
return 0;
}