zoukankan      html  css  js  c++  java
  • 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 -21
    

    Sample Output:

    10 1 4
    
    /* 求最大子序列  并记录该子序列的第一个数 和最后一个数。 
    */
    #include "iostream" using namespace std; int main() { int n; int thisSum = 0; int a[10000]; int MAX = -1; int start, end, endi, starti; int cnt = 0; cin >> n; bool flag = true; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] >= 0) flag = false; } if (flag) { cout << "0 " << a[0] <<" "<< a[n - 1] << endl; } else { for (int i = 0; i < n; i++) { thisSum += a[i]; if (thisSum > MAX) { MAX = thisSum; starti = i - cnt; end = a[i]; } if (thisSum < 0) { thisSum = 0; cnt = 0; } else { cnt++; } } cout << MAX << " " << a[starti] << " " << end << endl; } return 0; }
  • 相关阅读:
    从零开始学习html(五)与浏览者交互,表单标签——上
    从零开始学习html(四)认识标签(第三部分)
    从零开始学习html(三) 认识标签(第二部分)
    从零开始学习html(二)认识标签(第一部分)——下
    git 创建管理远程分支
    git分支
    Git 忽略一些文件不加入版本控制
    windows下 git+tortoiseGit的使用【转】
    WebStorm + JetBrains IDE Support 实现自动刷新功能
    Sublime Text 3 安装插件管理 Package Control
  • 原文地址:https://www.cnblogs.com/minesweeper/p/6282357.html
Copyright © 2011-2022 走看看