Pagini recente » Cod sursa (job #2145661) | Cod sursa (job #1197997) | Cod sursa (job #2694052) | Cod sursa (job #2457108) | Cod sursa (job #1866174)
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int sp[50005];
int main()
{
long long a, i, n, mj, ms=INT_MIN, mc=INT_MAX, k=0, ebun, ebine, erau;
f>>n>>k;mj=n;
for(i=1; i<=n; i++)
{
f>>a;
sp[i]=sp[i-1]+a;
if(i>k)
{
if(sp[i-k]<mc)
{
mc=sp[i-k];
ebun=i-k+1;
}
if(sp[i]-mc>ms)
{
ms=sp[i]-mc;
ebine=ebun;
erau=i;
}
}
}
g<<ebine<<' '<<erau<<' '<<ms;
return 0;
}