PAT1007 Maximum Subsequence Sum (25)
来源:互联网 发布:mysql 5.6 json函数 编辑:程序博客网 时间:2024/06/05 09:49
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. The Maximum 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 -21
Sample Output:10 1 4
int n,sum=0,ans=-1,left=0,right=0; cin >> n; int *a = new int[n]; bool flag = false; for (int i = 0; i < n; ++i){ cin >> a[i]; sum += a[i]; if (a[i] <0)flag = true;} for (int i = 0; i < n; ++i){ sum += a[i]; if (a[i] < 0){ flag = true; break; } } if (flag == false)printf("%d %d %d\n", sum, a[0], a[n - 1]); else{ for (int i = 0; i < n; ++i){ sum = 0; int j; for (j = i; j < n; ++j){ sum += a[j]; if (sum< 0)break; if (sum > ans){ ans = sum; left = a[i]; right = a[j]; } } i = j; } cout << ans << " " << left << " " << right << endl; }
- PAT1007. Maximum Subsequence Sum (25)
- PAT1007 Maximum Subsequence Sum (25)
- PAT1007. Maximum Subsequence Sum (25)
- PAT1007. Maximum Subsequence Sum (25)
- PAT1007. Maximum Subsequence Sum
- PAT1007. Maximum Subsequence Sum
- pat1007 Maximum Subsequence Sum
- 【DP-最大子串和】PAT1007. Maximum Subsequence Sum
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum[PAT1007][PTA01-复杂度2]——动态规划
- PAT1007:Maximun Subsequence Sum Java语言实现
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 网页制作
- android:documentLaunchMode
- Astar的自我学习
- 飛飛(三十九)警察和厨师的不可告人的秘密
- Java HashMap工作原理及实现(二)
- PAT1007 Maximum Subsequence Sum (25)
- System.arraycopy()实现数组之间的复制
- catalina.out文件内容置空
- 第十周第十一周项目3存储学生班长类
- A == B ?(揭开神奇的面纱)
- 兼职
- 比较靠谱的大学生兼职
- 快速替换文档并加着重号的方法
- 四级考试评分标准以及应对策略