Pagini recente » Cod sursa (job #101849) | Cod sursa (job #1301646) | Cod sursa (job #2095224) | Cod sursa (job #797787) | Cod sursa (job #1890250)
#include <cstdio>
#include <deque>
#define INF 0x3f3f3f3f
#define maxN 50000
using namespace std;
int s[maxN+1];
deque <int> d;
int main(){
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
int N, K, i, sMax, left, right;
scanf("%d%d", &N, &K);
for (i=1; i<=N; i++){
scanf("%d", &s[i]);
s[i]+=s[i-1];
}
sMax=-INF;
for (i=K; i<=N; i++){
while (!d.empty() && s[d.back()]>s[i-K])
d.pop_back();
d.push_back(i-K);
if (s[i]-s[d.front()]>sMax){
sMax=s[i]-s[d.front()];
left=d.front()+1;
right=i;
}
}
printf("%d %d %d\n", left, right, sMax);
return 0;
}