比较新颖的一道题目,需要将求解的思想转换成为几何中的关系,每次都是逐步的添加点,如果点的数量满足判断的个数的条件,首先就取出那些上突的点,然后存储当前点,紧接着再找出后续点与前面满足条件的那些点之间的最大的斜率所对应的那些点,然后再与已经保存的结果进行比较,如果当前待加入的点对的斜率更大或者该点对的包含的点的数量更少,那么就更新最终的结果,最后输出即可,具体实现见如下代码:
#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;
const int maxn = 100000 + 10;
char data[maxn];
int sum[maxn], p[maxn];
int compare(int ind11,int ind12,int ind21,int ind22){
return (sum[ind12] - sum[ind11 - 1])*(ind22 - ind21 + 1)
- (sum[ind22] - sum[ind21 - 1])*(ind12 - ind11 + 1);
}
int main(){
int T;
cin >> T;
while (T--){
int n, l;
cin >> n >> l;
for (int i = 1; i <= n; i++){
cin >> data[i];
}
sum[0] = 0;
for (int i = 1; i <= n; i++){
sum[i] = sum[i - 1] + (data[i] - '0');
}
int L = 1, R = l;
int i = 0, j = 0;
for (int ind = l; ind <= n; ind++){
while (j - i > 1 && compare(p[j-1],ind-l,p[j-2],ind-l)<=0) j--;
p[j++] = ind - l + 1;
while (j - i > 1 && compare(p[i+1],ind,p[i],ind)>=0) i++;
int res = compare(p[i], ind, L, R);
if (res > 0 || res == 0 && ind-p[i]<R-L){
L = p[i];
R = ind;
}
}
cout << L << " " << R << endl;
}
return 0;
}