Pagini recente » Cod sursa (job #1831488) | Cod sursa (job #792520) | Cod sursa (job #1783827) | Cod sursa (job #1261519) | Cod sursa (job #1679781)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
long int n, k, v[50005], sum[50005], bes, best=-1000000, i1best=-1, i2best=-1, i, minusm, minusi;
f>>n>>k;
for (i=0;i<n;i++)
f>>v[i];
sum[0]=v[0];
for (i=1;i<n;i++)
sum[i]=v[i]+sum[i-1];
minusm=0;
minusi=0;
for (i=k;i<n;i++)
{
if (sum[i-k]<minusm)
{
minusm=sum[i-k];
minusi=i-k+1;
}
bes=sum[i]-minusm;
if (best<bes)
{
best=bes;
i1best=minusi;
i2best=i;
}
}
g<<i1best+1<<' '<<i2best+1<<' '<<best;
return 0;
}