PAT 甲级 1007. Maximum Subsequence Sum
2017-08-26 18:52
501 查看
1007. Maximum Subsequence Sum (25)
时间限制400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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
求一段连续子序列的和而且要最大的,还要输出开始和结束的位置
dp的思想
#include<iostream>
#include<cstdio>
using namespace std;
int num[10010];
int main(){
int n;
cin>>n;
int start,end,tmp=0,sum=-1;
for(int i=0;i<n;i++) scanf("%d",&num[i]);
for(int i=0;i<n;i++){
tmp=0;
for(int j=i;j<n;j++){
tmp+=num[j];
if(tmp>sum){
sum=tmp;
start=num[i];
end=num[j];
}
}
}
if(sum<0){
printf("0 %d %d\n",num[0],num[n-1]);
return 0;
}
printf("%d %d %d\n",sum,start,end);
return 0;
}
相关文章推荐
- PAT(甲级) 1007. Maximum Subsequence Sum (25)
- PAT(甲级)1007. Maximum Subsequence Sum (25)
- [PAT甲级]1007. Maximum Subsequence Sum(求连续最大子序列和)
- 【PAT甲级】【C++】1007. Maximum Subsequence Sum (25)
- 【PAT甲级】1007. Maximum Subsequence Sum (25)
- PAT 甲级 1007. Maximum Subsequence Sum (25)
- PAT甲级 1007. Maximum Subsequence Sum (25)
- PAT 甲级 1007. Maximum Subsequence Sum
- PAT 甲级 1007. Maximum Subsequence Sum (25) 【最大子串和】
- PAT - 甲级 - 1007. Maximum Subsequence Sum (25)
- PAT 甲级 1007. Maximum Subsequence Sum
- PAT甲级-1007. Maximum Subsequence Sum (25)最大子序列和
- PAT 甲级 1007. Maximum Subsequence Sum (DP 动态规划)
- [PAT-甲级]1007.Maximum Subsequence Sum
- pat(A) 1007. Maximum Subsequence Sum(和最大子段)
- 【c++】PAT (Advanced Level) 1007. Maximum Subsequence Sum (25)*
- PAT 1007. Maximum Subsequence Sum
- PAT-AL 1007. Maximum Subsequence Sum
- PAT 1007. Maximum Subsequence Sum (25)
- 【PAT】1007. Maximum Subsequence Sum (25)