PAT -1007
来源:互联网 发布:linux 查看死机原因 编辑:程序博客网 时间:2024/06/15 18:07
1007. Maximum Subsequence Sum
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. TheMaximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.
Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.
Input Specification:
Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.
Output Specification:
For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.
Sample Input:10-10 1 2 3 4 -5 -23 3 7 -21Sample Output:
10 1 4
#if 1#include <stdio.h>#define MAXN (100000+1)int FindMaxSubsequence(int a[],int n,int *l,int *r){int CurSum,MaxSum;int i,tempL;*l = 0;*r = 0;tempL = 0;CurSum = a[0];MaxSum = a[0];for(i = 1;i < n;i++){if(CurSum < 0){tempL = i;CurSum = 0;}CurSum += a[i];if(MaxSum < CurSum){MaxSum = CurSum;*r = i;*l = tempL;}}return MaxSum;}int a[MAXN];int main(int argc,char *argv[]){int n;int i;int NegCnt;int l,r,MaxSum;freopen( "D:\\Chengsq\\in.txt" , "r" ,stdin); freopen( "D:\\Chengsq\\out.txt", "w" ,stdout);while(scanf("%d",&n) != EOF){NegCnt = 0;for(i = 0;i < n;i++){scanf("%d",&a[i]);if(a[i] < 0)NegCnt++;}if(NegCnt == n){MaxSum = 0;l= 0;r = n-1;}else{MaxSum = FindMaxSubsequence(a,n,&l,&r);} printf("%d %d %d\n",MaxSum,a[l],a[r]);}return 0;}#endif
- PAT -1007
- pat 1007
- PAT 1007
- pat 1007
- PAT 1007
- PAT 1007
- PAT-1007
- PAT Basic 1007
- 浙江大学pat 1007
- PAT BASIC 1007
- PAT(A) 1007
- PAT Basic 1007
- PAT Advanced Level 1007
- PAT(甲级)1007
- PAT Basic 1007
- PAT甲级1007
- PAT乙级1007
- PAT 乙级 1007
- 在Visual Studio中使用VMWare插件进行远程调试
- C# 多线程委托方式让主界面显示传值内容
- VC 数据类型 BYTE WORD DWORD
- 使用ThreadLocal解决多线程程序并发问题
- System.Collections.ArrayList用法
- PAT -1007
- source insight下载
- 现在, Delphi 的多线程已经非常易用了!
- 转换到回文字符串
- vc 判断一个字符串是否位数字,且判断此数字的范围
- CString/string/char*/char[]/int/float相互转化
- myminimad.c
- C语言运算符优先级
- 我的工作日志4