本文主要是介绍【PAT】【Advanced Level】1007. Maximum Subsequence Sum (25)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
1007. Maximum Subsequence Sum (25)
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 -21Sample Output:
10 1 4
原题链接：
https://www.patest.cn/contests/pat-a-practise/1007
思路：
边输入边统计截止到这一位之前所有数字的和
输入完毕后双重循环扫描一遍
最后判断结果是否小于0，输出
CODE：
#include<iostream>
using namespace std;int main()
{int n;cin>>n;int sum[n+2];int num[n+2];sum[0]=0;for (int i=1;i<=n;i++){cin>>num[i];sum[i]=sum[i-1]+num[i];}int ma=-100000000;int l=0;int r=0;for (int i=0;i<n;i++)for (int j=i+1;j<=n;j++){if (sum[j]-sum[i]>ma){ma=sum[j]-sum[i];l=num[i+1];r=num[j];}}if (ma<0){cout<<"0"<<" "<<num[1]<<" "<<num[n];}elsecout<<ma<<" "<<l<<" "<<r;return 0;
}
这篇关于【PAT】【Advanced Level】1007. Maximum Subsequence Sum (25)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
