• 01-复杂度2 Maximum Subsequence Sum


    01-复杂度2 Maximum Subsequence Sum   (25分)

    • 时间限制:200ms
    • 内存限制:64MB
    • 代码长度限制:16kB
    • 判题程序:系统默认
    • 作者:陈越
    • 单位:浙江大学

    https://pta.patest.cn/pta/test/3512/exam/4/question/58272

    Given a sequence of KKK integers { N1N_1N1​​, N2N_2N2​​, ..., NKN_KNK​​ }. A continuous subsequence is defined to be { NiN_iNi​​, Ni+1N_{i+1}Ni+1​​, ..., NjN_jNj​​ } where 1≤i≤j≤K1 le i le j le K1ijK. 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 KKK (≤10000le 1000010000). The second line contains KKK 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 iii and jjj (as shown by the sample case). If all the KKK 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
    
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 
     4 int main()
     5 {
     6     int k,x,maxSum=-1,sum=0,s=0,st=0,e;
     7     cin>>k;
     8     for(int i=0;i<k;i++)
     9     {
    10         cin>>x;
    11         if(!i)
    12             s=x;
    13         if(sum<0||!i)
    14         {
    15             sum=0;
    16             st=x;
    17         }
    18         sum+=x;
    19         if(sum>maxSum)
    20         {
    21             maxSum=sum;
    22             s=st;
    23             e=x;
    24         }
    25     }
    26     if(maxSum<0)
    27     {
    28         maxSum=0;
    29         e=x;
    30     }
    31     cout<<maxSum<<' '<<s<<' '<<e;
    32     return 0;
    33 }
  • 相关阅读:
    mySQL安装的时候一直卡在starting server这里解决办法
    编译安装nginx
    用户访问网站原理及流程
    mysql备份及恢复
    sed
    mysql 基础
    nginx优化
    mysql 三种日志
    tr
    date
  • 原文地址:https://www.cnblogs.com/Fresh--air/p/6701097.html
Copyright © 2020-2023  润新知