北大1480 最长子序列和

#include<iostream>#include<cstdio>#include<algorithm>using namespace std;int main(){   int n;   int num[1001]={0};   int sum[1001]={0};   while(scanf("%d",&n)!=EOF){        for(int i = 0;i<n;i++)scanf("%d",&num[i]);for(int i = 0;i<n;i++){//int t = i;sum[i] = num[i];for(int j = 0;j<i;j++){if(num[i]>num[j]&&sum[i]<num[i]+sum[j]){//动态规划    sum[i] = num[i]+sum[j];//i = j;}}            //i = t;}sort(sum,sum+n);printf("%d\n",sum[n-1]);   }}