xiaobai11as的博客

算法是一种乐趣

训练3 习题3

题目:

Input
Input contains multiple test cases. Each test case is described in a line as follow:<br>N value_1 value_2 …value_N <br>It is guarantied that N is not more than 1000 and all value_i are in the range of 32-int.<br>A test case starting with 0 terminates the input and this test case is not to be processed.<br>
 

Output
For each case, print the maximum according to rules, and one line one case.<br>
 

Sample Input
3 1 3 2 4 1 2 3 4 4 3 3 2 1 0
 

Sample Output
4 10 3



思路:


令d[i]表示以第i个数字结尾的和最大的递增子序列  得到d[i]=max(d[i],d[j]+a[i]) (j为1到a之间的数  且a[i]>a[j])



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

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/xiaobai11as/article/details/51549764
文章标签: acm
个人分类: 动态规划
上一篇训练3 习题24
下一篇训练3 总结
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭