【c++】PAT (Advanced Level) 1007. Maximum Subsequence Sum (25)*
来源:互联网 发布:java基础入门书籍推荐 编辑:程序博客网 时间:2024/05/23 19:55
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. TheMaximum 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
1.对于两端的设置 for循环的时候 vector.size()-1
2.对于0的处置,貌似没有说清楚 ,0不包含在队列里面,
3,看错题目啦 ,是输入头和尾巴的数字
#include <iostream>#include <vector>using namespace std;int main() {freopen("in.txt","r",stdin);int k;while(cin>>k){vector<int> cc;while(k--){int a;cin>>a;cc.push_back(a);}int begin,end,suma=-1;for(int i=0;i<cc.size();i++){if((i==0&&cc[i]>0)||(i>0&&cc[i]>0&&cc[i-1]<=0)){int sum=0;for(int j=i;j<cc.size();j++){sum=sum+cc[j];if((j==cc.size()-1&&cc[j]>0)||(j<(cc.size()-1)&&cc[j]>0&&cc[j+1]<=0)){if(sum>suma){begin=cc[i];end=cc[j];suma=sum;}}elsecontinue;}}else continue;}if(suma==-1){begin=cc[0],end=cc[cc.size()-1];suma=0;}cout<<suma<<" "<<begin<<" "<<end;} return 0;}
- 【c++】PAT (Advanced Level) 1007. Maximum Subsequence Sum (25)*
- 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)
- 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) (C语言实现)
- 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)
- HTML5 Canvas元素的教程
- 1035:放大的X
- 分页查询
- 1016 重要Phone Bills (25)
- Oracl 11g win7 install
- 【c++】PAT (Advanced Level) 1007. Maximum Subsequence Sum (25)*
- Mac OS上安装Boost C++ Libraries
- 6. TextView 控件
- 排序之堆排序
- Android初学者之ContentValues
- Android强制设置横屏或竖屏
- 主机,虚拟机,开发板互相ping通
- 机器学习其实比你想的更简单
- 常用的图像去噪方法