Max Sum of Max-K-sub-sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8053 Accepted Submission(s): 2945
Problem Description
Given a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the right neighbour of A[n] is A[1].
Now your job is to calculate the max sum of a Max-K-sub-sequence. Max-K-sub-sequence means a continuous non-empty sub-sequence which length not exceed K.
Now your job is to calculate the max sum of a Max-K-sub-sequence. Max-K-sub-sequence means a continuous non-empty sub-sequence which length not exceed K.
Input
The first line of the input contains an integer T(1<=T<=100) which means the number of test cases.
Then T lines follow, each line starts with two integers N , K(1<=N<=100000 , 1<=K<=N), then N integers followed(all the integers are between -1000 and 1000).
Then T lines follow, each line starts with two integers N , K(1<=N<=100000 , 1<=K<=N), then N integers followed(all the integers are between -1000 and 1000).
Output
For each test case, you should output a line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the minimum start position, if still more than one , output the minimum length of them.
Sample Input
4 6 3 6 -1 2 -6 5 -5 6 4 6 -1 2 -6 5 -5 6 3 -1 2 -6 5 -5 6 6 6 -1 -1 -1 -1 -1 -1
Sample Output
7 1 3 7 1 3 7 6 2 -1 1 1
题意:给出一个有N个数字(-1000..1000,N<=10^5)的环状序列,让你求一个和最大的连续子序列。这个连续子序列的长度小于等于K。
就是求一个max(sum[i] - sum[j]) (i - k <= j)
单调队列实现,顺便记录下位置
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
const int Max = 100005;
const int INF = 0x3f3f3f3f;
int N, K, fro, back;
int A[Max << 1], Dp[Max << 1], P[Max << 1],Q[Max << 1];
void getint(int & num){
char c; int flag = 1; num = 0;
while((c = getchar()) < '0' || c > '9')if(c=='-')flag=-1;
while(c >= '0' && c <= '9'){ num = num * 10 + c - 48; c = getchar();}
num *= flag;
}
int main(){
int T;
getint(T);
while(T --){
getint(N), getint(K);
int x;
for(int i = 1; i <= N; ++ i){
getint(x);
A[i] = A[i - 1] + x;
}
for(int i = 1; i < K; ++ i)
A[i + N] = A[i - 1 + N] + A[i] - A[i - 1];
fro = 1, back = 1;
N += K - 1;
for(int i = 1; i <= N; ++ i){
while(fro <= back && Q[fro] + K < i) ++ fro;
while(fro <= back && A[Q[back]] >= A[i]) -- back;
Dp[i] = A[i] - A[Q[fro]];
P[i] = Q[fro] + 1;
Q[++ back] = i;
}
int pos = 1;
for(int i = 2; i <= N; ++ i) if(Dp[i] > Dp[pos])
pos = i;
N -= K - 1;
printf("%d %d %d\n", Dp[pos], P[pos], (pos > N ? pos % N : pos));
memset(Q, 0, sizeof(Q));
}
return 0;
}