HDU1003——Max Sum(DP)

Problem Description
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
 

Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
 

Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.
 

Sample Input
2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5
 

Sample Output
Case 1: 14 1 4 Case 2: 7 1 6
 



分析:


听说这是DP、我没研究过DP题目、这道题按照自己思路写的、中间有点小卡壳、看

了一些博客、借鉴了一下。听说这是DP的入门级别的题。如果各个子问题不是独立

的,不同的子问题的个数只是多项式量级,如果我们能够保存已经解决的子问题的答

案,而在需要的时候再找出已求得的答案,这样就可以避免大量的重复计算。由此而

来的基本思路是,用一个表记录所有已解决的子问题的答案,不管该问题以后是否被

用到,只要它被计算过,就将其结果填入表中——from LCY


——>就是总是把当前最大的数记录下来、然后扫描一遍。




#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
int n,t;
int i,j;
int start,end;
int a[100007];
int w=1;
int f(int p)
{
    int max,ls,le;
    int sum=max=-99999;
    for(int i=0; i<p; i++)
    {
        if(sum<0)
        {
            if(a[i]>sum)
            {
                sum=a[i];
                ls=le=i;
                if(sum>max)
                {
                    max=sum;
                    start=ls;
                    end=le;
                }
            }
        }
        else
        {
            sum+=a[i];
            le=i;
            if(sum>max)
            {
                max=sum;
                start=ls;
                end=le;
            }
        }
    }
    return max;
}
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=0; i<n; i++)
            scanf("%d",&a[i]);
        int r=f(n);
        printf("Case %d:\n",w++);
        printf("%d %d %d\n",r,start+1,end+1);
        if(t)
            printf("\n");
    }
    return 0;
}



hdu1003,

06-02

http://acm.hdu.edu.cn/showproblem.php?pid=1003rnProblem DescriptionrnGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.rn rnrnInputrnThe first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).rn rnrnOutputrnFor each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.rn rnrnSample Inputrnrn2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5rnrn rnrnSample OutputrnrnCase 1: 14 1 4 Case 2: 7 1 6rnrn rnrnAuthorrnIgnatius.Lrnrn一个就最大子序列和的程序,不知道怎么搞的,我写的就是通不过,一直是wa,谁帮我看下是哪边的问题或给个测试数据也行。rn代码如下:rn[code=C/C++]rn#include rn#include rn#include rnusing namespace std;rnint ptrArray[100001];rnint ptrStatus[100001];rnrnint GetMaxSub(const int *array, int nCount, int &nStartID, int &nEndID)rnrn memset(ptrStatus, -9999, 100001);rn nStartID = 0;rn nEndID = 0;rnrn ptrStatus[0] = array[0];rnrn int nMaxStartID = 0;rn int nMaxEndID = 0;rn int nMax = ptrStatus[0];rnrn for (int nStatus = 1; nStatus < nCount; ++nStatus)rn rn if (ptrStatus[nStatus - 1] >= 0)rn rn ptrStatus[nStatus] = ptrStatus[nStatus - 1] + array[nStatus];rn rn elsern rn ptrStatus[nStatus] = array[nStatus];rn int n = ptrStatus[nStatus];rnrn if (ptrStatus[nStatus] > 0)rn rn nStartID = nStatus; rn rn rnrn if (ptrStatus[nStatus] > nMax)rn rn nMax = ptrStatus[nStatus];rn nMaxStartID = nStartID;rn nMaxEndID = nStatus;rn rn rnrn nStartID = nMaxStartID + 1;rn nEndID = nMaxEndID + 1;rnrn return nMax;rnrnrnint main()rnrn int nTestCase;rn cin >> nTestCase;rnrn int nStartID;rn int nEndID;rnrn for (int nTestID = 0; nTestID < nTestCase; ++nTestID)rn rn int nCount;rn cin >> nCount;rnrn for (int nID = 0; nID < nCount; ++nID)rn rn cin >> ptrArray[nID];rn rnrn cout << "Case " << nTestID + 1 << ":" << endl;rn cout << GetMaxSub(ptrArray, nCount, nStartID, nEndID);rn cout << " " << nStartID << " " << nEndID << endl;rnrn if (nTestID != nTestCase - 1)rn rn cout << endl;rn rn rnrn return 0;rnrn[/code]

杭电ACM 1003 题 Max Sum

07-02

Max SumrnProblem DescriptionrnGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.rnrn rnrnInputrnThe first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).rnrn rnrnOutputrnFor each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.rnrn rnrnSample Inputrn2rn5 6 -1 5 4 -7rn7 0 6 -1 1 -6 7 -5rn rnrnSample OutputrnCase 1:rn14 1 4rnrnCase 2:rn7 1 6rnrn[color=#FF0000][size=16px]以上是题目:rn我测试了一下我的代码 完全能得到想要的结果 但是杭电那就是一直通不过 显示wrong 希望哪位高手帮我看一下是格式有问题还是特殊情况没有考虑进来rnrnrn以下是我的代码:rn[/size][/color]rn[code=C/C++]#includernint main()rnrn int n,i,j,k=0,K,sum=0,SUM=0,end=0,start=1,flag=0,T=0,J;rn int a[100000];rn while((scanf("%d",&n))!=EOF)rn k=0;end=0;start=1;rn while(n--)rn SUM=0;end=0;start=1;rn scanf("%d",&a[0]);rn for(i=1;i<=a[0];i++)rn rn scanf("%d",&a[i]);rn rn for(i=1;i<=a[0];i++)rn rn K=a[i];sum=0;rn if(K>=0) end++;rn if(a[i]<0)rn rn int t=0;rn sum=a[i];rn for(j=i+1;sum<=0&&j<=a[0];j++)rn rn sum=sum+a[j];t++;rn rn if(sum<=0) sum=0;K=0;flag=-t-1;rn i=j-1;rn K=0;rn end=i+flag;rn flag=0;rn rn SUM=SUM+sum+K;rn rn T=0;rn for(J=a[0];J>=0;J--)rn rn if(a[J]==0) T++;rn else break;rn rn if(T==a[0]-J) end=end-T;rn k++;rn printf("Case %d:\n",k);rn if(a[1]==0&&SUM==0) end=1;start=1;rn if(SUM==0&&sum==0) end=0;start=0;rn printf("%d %d %d\n\n",SUM,start,end);rn rn rn return 0;rnrn[/code]

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

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试