Pagini recente » Cod sursa (job #2484566) | Cod sursa (job #2366472) | Cod sursa (job #1164433) | Cod sursa (job #2316244) | Cod sursa (job #1355076)
#include <iostream>
#include <fstream>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int a[50001];
int sp[50001];
int msp[50001];
int main()
{
int n,k,smax = -INF,solSt,solDr;
fin>>n>>k;
for(int i = 1; i <= n; i++)
{
fin>>a[i];
sp[i] = sp[i-1] + a[i];
}
for(int i = k; i <= n; i++)
{
if(sp[msp[i-1]] < sp[i-k])
msp[i] = msp[i-1];
else msp[i] = i-k;
if(sp[i] - sp[msp[i]] > smax)
{
smax = sp[i] - sp[msp[i]];
solDr = i;
solSt = msp[i];
}
}
fout<<solSt+1<<' '<<solDr<<' '<<smax;
return 0;
}