PAT (Advanced Level) Practise - 1007. Maximum Subsequence Sum (25)
2017-11-04 22:43
483 查看
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:
Sample Output:
最长连续子序列求和。 输出头和尾。
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <map>
using namespace std;
#define LL long long
const int maxn = 10004;
const int inf = 0x3f3f3f3f;
int a[maxn];
int cnt=0;
int main()
{
int n;
scanf("%d",&n);
int f=0;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
if(a[i]>=0) f=1;
}
if(!f){
printf("0 %d %d\n",a[1],a
);
return 0;
}
int now=0;
int fi,fj;
int len=0;
int Max=0;
for(int i=1;i<=n;i++){
now+=a[i];
len++;
if(Max<now){
Max=now;
fj=a[i];
fi=a[i-len+1];
}
if(now<0){
len=0;
now=0;
}
}
printf("%d %d %d\n",Max,fi,fj);
}
时间限制
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
最长连续子序列求和。 输出头和尾。
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <map>
using namespace std;
#define LL long long
const int maxn = 10004;
const int inf = 0x3f3f3f3f;
int a[maxn];
int cnt=0;
int main()
{
int n;
scanf("%d",&n);
int f=0;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
if(a[i]>=0) f=1;
}
if(!f){
printf("0 %d %d\n",a[1],a
);
return 0;
}
int now=0;
int fi,fj;
int len=0;
int Max=0;
for(int i=1;i<=n;i++){
now+=a[i];
len++;
if(Max<now){
Max=now;
fj=a[i];
fi=a[i-len+1];
}
if(now<0){
len=0;
now=0;
}
}
printf("%d %d %d\n",Max,fi,fj);
}
相关文章推荐
- PAT (Advanced Level) Practise 1007. Maximum Subsequence Sum (25)
- PAT (Advanced Level) Practise 1007. Maximum Subsequence Sum (25)
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 最大连续子数组,一次遍历,stack辅助
- 【PAT】【Advanced Level】1007. Maximum Subsequence Sum (25)
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25)
- 【PAT Advanced Level】1007. Maximum Subsequence Sum (25)
- 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 (25) dp
- 【c++】PAT (Advanced Level) 1007. Maximum Subsequence Sum (25)*
- PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) vector
- 浙大PAT (Advanced Level) Practise 1043 Is It a Binary Search Tree (25)
- 浙大 PAT Advanced level 1007. Maximum Subsequence Sum
- 1089. Insert or Merge (25)【排序】——PAT (Advanced Level) Practise
- 1105. Spiral Matrix (25)【模拟】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1125 Chain the Ropes (25)
- 1016. Phone Bills (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1013. Battle Over Cities (25)
- 1063. Set Similarity (25)【集合操作】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1070 Mooncake (25)