PAT_A 1007. Maximum Subsequence Sum (25)
2016-11-20 21:31
453 查看
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:
分析:20分的题不说了,注意题意就行
code
#include<iostream> #include<vector> using namespace std; int K; vector<int>data; int main() { cin>>K; int tmp; int isNegative=true; for(int i=0;i<K;i++) { cin>>tmp; if(tmp>=0) isNegative=false; data.push_back(tmp); } if(isNegative) { cout<<0<<" "<<data[0]<<" "<<data[K-1]<<endl; return 0; } int a,b,_max; a=b=0; _max=data[0]; for(int i=0;i<K;i++) { int sum=0; for(int j=i;j<K;j++) { sum+=data[j]; if(_max<sum) { //如果最大的重复了,需要比较ij _max=sum; a=i; b=j; } } } //做题急躁,不认真读题 //cout<<_max<<" "<<a<<" "<<b<<endl; cout<<_max<<" "<<data[a]<<" "<<data[b]<<endl; return 0; }
相关文章推荐
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) vector
- 【PAT】【Advanced Level】1007. Maximum Subsequence Sum (25)
- 【PAT甲级】【C++】1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 解题报告
- PAT 1007. Maximum Subsequence Sum (25)
- PAT 甲级 1007. Maximum Subsequence Sum (25)
- pat 1007. Maximum Subsequence Sum (25)
- PAT (Advanced) 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)
- PAT - 甲级 - 1007. Maximum Subsequence Sum (25)
- PAT 1007. Maximum Subsequence Sum (25)(dp动态规划)
- PAT (Advanced Level) Practise 1007. Maximum Subsequence Sum (25)
- PAT-1007. Maximum Subsequence Sum (25)
- 【PAT Advanced Level】1007. Maximum Subsequence Sum (25)
- PAT Advanced 1007. Maximum Subsequence Sum (25) (C语言实现)
- 【PAT】1007. Maximum Subsequence Sum (25)
- PAT(甲级)1007. Maximum Subsequence Sum (25)
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25)
- PAT甲级 1007. Maximum Subsequence Sum (25)