PAT Advanced 1007 Maximum Subsequence Sum (25 分)

PAT Advanced 1007 Maximum Subsequence Sum (25 分)
强烈推介IDEA2021.1.3破解激活,IntelliJ IDEA 注册码,2021.1.3IDEA 激活码  

大家好,我是架构君,一个会写代码吟诗的架构师。今天说一说PAT Advanced 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. 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 (≤). 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
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    /**计算时间
    * 开始7:14
    * 结束7:27
    */
    int T;
    cin>>T;int sum=0,tmp,max=-1;
    vector<int> vec;
    vector<int> res;
    vector<int> all;
    while(T--){
        cin>>tmp;
        all.push_back(tmp);
        vec.push_back(tmp);
        sum+=tmp;
        if(sum>max) {
            max=sum;
            res=vec;
        }
        if(sum<0){
            sum=0;
            vec.clear();
        }
    }
    if(max!=-1) cout<<max<<" "<<res[0]<<" "<<res[res.size()-1];
    else cout<<0<<" "<<all[0]<<" "<<all[all.size()-1];
    system("pause");
    return 0;
}

 

转载于:https://www.cnblogs.com/littlepage/p/11286389.html

本文来源weixin_30595035,由架构君转载发布,观点不代表Java架构师必看的立场,转载请标明来源出处:https://javajgs.com/archives/29558

发表评论