hdu 1003 Max Sum

来源:互联网 发布:qq旋风 for mac 编辑:程序博客网 时间:2024/06/06 19:17
#include<stdio.h>#define MAX 100000int main(){    int n_case, num[MAX], index[MAX], n;    scanf("%d", &n_case);    for (int k = 1; k <= n_case; k++)    {        int ans, pos = 0;        scanf("%d", &n);        scanf("%d", &num[0]);        ans = num[0];        index[0] = 0;        for (int i = 1; i < n; i++)        {            scanf("%d", &num[i]);            if (num[i]+num[i-1] > num[i])            {                num[i] = num[i]+num[i-1];                index[i] = index[i-1];            }            else            {                index[i] = i;            }            if (num[i] > ans)            {                ans = num[i];                pos = i;            }        }        printf("Case %d:\n%d %d %d\n", k, ans, index[pos]+1, pos+1);        if (k < n_case)            printf("\n");    }}

0 0
原创粉丝点击