Max Sum of Max-K-sub-sequence----单调队列

至于题是哪来的，老师BB出来的
至于怎么BB的，请自己联想
我洛谷上的博客

Max Sum of Max-K-sub-sequence

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.

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).

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

题意自己百度

这道题，可以这样做

解释都在注释和下面
`

由于是一个圈
1 2 3 4 5
显然1的左边还有5
那么我们就把问题分为两类
第一类：
	就是一个没有跨过了n的序列
第二类：
	一个跨过了n的序列`

第一类

题意可转换为
有一序列
在其中找一个长度不超过k的子序列使其和最大
有多个子序列满足条件的按题意输出
就用。。。

第二类

在整个序列中找一子序列，使其总和最小且长度大于等于n - k
ans = ALL - 子序列总和

是不是很简单( ⊙ o ⊙ )啊！

#include <cstdio>
#include <climits>
const int MAXN = 100001;
class MYOWN
{
   
	public:
		int val,it;
		MYOWN()
		{
   
			val = 0;
			it = 0;
		}
};