B - Maximum Absurdity

先全部加起來再用級數定理取出每個區間的值

然後一一的紀錄從 0 到 i 之中最大的區間給 i

之後枚舉每個區間並且加上 i-k 記錄的最大區間，AC

Copy
//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 200005
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n,k;
Int x\[M\],y\[M\];
int bes\[M\];
void solve(){
for(int i=1;i<n;i++){
x\[i\]+=x\[i-1\];
}
memcpy(y,x,sizeof(x));
for(int i=0;i<k-1;i++)x\[i\]=0;
for(int i=k;i<n;i++){
x\[i\]-=y\[i-k\];
}
Int mx=0;
int index=0;
for(int i=0;i<n;i++){
if(x\[i\]>mx){
mx=x\[i\];
index=i;
}
bes\[i\]=index;
}
// for(int i=0;i<n;i++)printf("%d ",bes\[i\]);
mx=0;
int fa,sa;
for(int i=(k\*2-1);i<n;i++){
Int now=x\[i\];
now+=x\[bes\[i-k\]\];
if(now>mx){
mx=now;
fa=bes\[i-k\]-k+1;
sa=i-k+1;
}
}
printf("%d %d\\n",fa+1,sa+1);
}
int main() {
ios\_base::sync\_with\_stdio(0);
while(~scanf("%d%d",&n,&k)){
for(int i=0;i<n;i++){
scanf("%I64d",&x\[i\]);
}
solve();
}

}