HDU-1003-Max Sum

最新推荐文章于 2023-01-19 13:55:02 发布

f_zyj

最新推荐文章于 2023-01-19 13:55:02 发布

阅读量303

点赞数

分类专栏：动态规划 51Nod-题解集锦文章标签： dp

本文链接：https://blog.csdn.net/f_zyj/article/details/52772623

版权

51Nod-题解集锦同时被 2 个专栏收录

460 篇文章 35 订阅

订阅专栏

动态规划

174 篇文章 3 订阅

订阅专栏

ACM模版

描述

题解

经典的dp，求最大子段和。

代码

#include<iostream>

#define MAXN 100010

using namespace std;

int a[MAXN], d[MAXN];

int main()
{
    int T;
    int n;
    int max, key = 1;
    cin >> T;

    while (T--)
    {
        cin >> n;
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
        }
        d[1] = a[1];
        for (int i = 2; i <= n; i++)
        {
            if (d[i - 1] < 0)
            {
                d[i] = a[i];
            }
            else
            {
                d[i] = d[i - 1] + a[i];
            }
        }
        max = d[1];
        int end = 1;
        for (int i = 2; i <= n; i++)
        {
            if (max < d[i])
            {
                max = d[i];
                end = i;
            }
        }
        int sum = 0;
        int start = end;
        for (int i = end; i > 0; i--)
        {
            sum = sum + a[i];
            if (sum == max)
            {
                start = i;
            }
        }
        cout << "Case " << key++ << ":" << endl << max << " " << start << " " << end << endl;
        if (T)
        {
            cout << endl;
        }
    }

    return 0;
}