PAT Advanced Level 1007:Maximum Subsequence Sum
来源:互联网 发布:ubuntu 开机任务栏没了 编辑:程序博客网 时间:2024/05/29 19:15
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
当sum<0,直接从后面开始找,这样比较快
#include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>using namespace std;int main(){ //freopen("input.txt","r",stdin); int K,i=0,j,s=0,t=-1; int p,q; int N[10000]; int maxSum=0; int thisSum=0; scanf("%d",&K); for(j=0;j<K;++j){ scanf("%d",&N[j]); if(N[j]>0){ s=1; } if(N[j]==0){ t=j; } thisSum+=N[j]; if(thisSum>maxSum){ maxSum=thisSum; p=i; q=j; } if(thisSum<0){ i=j+1; thisSum=0; } } //处理特殊情况,都是非正数的情况 if(s==0){ //处理,即要是测试案例是-4 0 -1这样 if(t!=-1){ printf("0 %d %d",N[t],N[t]); return 0; } printf("0"); printf(" %d %d",N[0],N[K-1]); return 0; } printf("%d %d %d",maxSum,N[p],N[q]); return 0;}
- PAT Advanced Level 1007:Maximum Subsequence Sum
- PAT(Advanced level) 1007. Maximum Subsequence Sum*
- Pat(Advanced Level)Practice--1007(Maximum Subsequence Sum)
- PAT (Advanced Level) Practise 1007 Maximum Subsequence Sum (25)
- PAT (Advanced Level) Practise 1007 Maximum Subsequence Sum
- pat PAT (Advanced Level) Practise 1007. Maximum Subsequence Sum (25)
- 【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 解题文档
- 浙大 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) 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 最大连续子数组,一次遍历,stack辅助
- 6.18 Exiting Threads and Timers
- Hdu1015Safecracker(dfs)
- 达芬奇软件架构
- iOS如何将不可变变量改变成可变变量, deep copy objects into mutable
- 编程之美学习笔记2.1求二进制数中1的个数
- PAT Advanced Level 1007:Maximum Subsequence Sum
- 关于uboot.lds文件的分析
- 辨析--数组,指针
- 在知行学校感受国学古韵
- JAVA基础知识点
- 谈谈如何激励项目成员 一
- oracle操作
- java时间戳
- 各种语言匹配的正则