hdu-1087

来源：互联网发布：mac如何下载魔兽世界编辑：程序博客网时间：2024/05/25 05:34

最大递增子段和

#include<stdio.h>#include<iostream>#include<math.h>#include<stdlib.h>#include<ctype.h>#include<algorithm>#include<vector>#include<string.h>#include<queue>#include<stack>#include<set>#include<map>#include<sstream>#include<time.h>#include<utility> #include<malloc.h> #include<stdexcept>using namespace std;int a[10000];int dp[10000];int maxx (int a,int b){    if (a>b)        return a;    else        return b;}int main(){    int n;    while (scanf ("%d",&n)!=EOF && n )    {        for (int i=1;i<=n;i++)                    scanf ("%d",&a[i]);        dp[1]=a[1];        int ans=dp[1];        int max ;        for (int i=2;i<=n;i++)            {            max=0;            for (int j=1;j<i;j++)            {                if (a[j]< a[i] && dp[j] > max )                    max= dp[j];            }            dp[i]=max+a[i];             ans= maxx (ans,dp[i]);        }        printf("%d\n",ans);    }    return 0;}

0 0