Pagini recente » Cod sursa (job #1481411) | Cod sursa (job #231988) | Cod sursa (job #2474671) | Cod sursa (job #271516) | Cod sursa (job #2342217)
#include <bits/stdc++.h>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int a[50001];
int main()
{
long long n, k, sf = 1, p = 0, ic = 1, smax = -922337203685477580;
in>>n>>k;
for(int i = 1; i<=n; i++)
{
in>>a[i];
a[i]+=a[i-1];
}
for(int i = k; i<=n; i++)
{
if(a[p]>a[i-k])
p = i-k;
if(a[i] - a[p] > smax)
{
smax = a[i] - a[p];
ic = p+1;
sf = i;
}
}
out<<ic<<" "<<sf<<" "<<smax;
return 0;
}