【PAT】【Advanced Level】1007. Maximum Subsequence Sum (25)
来源:互联网 发布:win8有线网络连接受限 编辑:程序博客网 时间:2024/06/16 12:42
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]; } else cout<<ma<<" "<<l<<" "<<r; return 0;}
- pat PAT (Advanced Level) Practise 1007. Maximum Subsequence Sum (25)
- PAT(Advanced level) 1007. Maximum Subsequence Sum*
- 【PAT Advanced Level】1007. Maximum Subsequence Sum (25)
- 【c++】PAT (Advanced Level) 1007. Maximum Subsequence Sum (25)*
- PAT (Advanced Level) Practise 1007. Maximum Subsequence Sum (25)
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 解题报告
- PAT (Advanced Level) Practise 1007. Maximum Subsequence Sum (25)
- 【PAT】【Advanced Level】1007. Maximum Subsequence Sum (25)
- PAT (Advanced Level) Practise 1007. Maximum Subsequence Sum (25)
- PAT Advanced Level 1007:Maximum Subsequence Sum
- PAT (Advanced) 1007. Maximum Subsequence Sum (25)
- [PAT (Advanced Level) ]1007. Maximum Subsequence Sum 解题文档
- 浙大 PAT Advanced level 1007. Maximum Subsequence Sum
- PAT (Advanced Level) Practise 1007 Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 最大连续子数组,一次遍历,stack辅助
- Pat(Advanced Level)Practice--1007(Maximum Subsequence Sum)
- PAT (Advanced Level) Practise 1007 Maximum Subsequence Sum
- 线程池的使用
- N!的位数 【java 高精度处理】
- HashMap和原理(面试必考)
- python 实例简述 k-近邻算法的基本原理
- Chapter4.1 虚拟机性能监控与故障处理工具一
- 【PAT】【Advanced Level】1007. Maximum Subsequence Sum (25)
- centos 7 Firewall的配置
- HDU
- QT编程-day3
- Java IO 读写ArrayList
- 用Python将excel文件导出成json
- STL之vector成员函数
- Java中的异常处理机制的简单原理和应用
- Git远程操作pull和push使用总结