Pagini recente » Cod sursa (job #2811970) | Cod sursa (job #321895) | Cod sursa (job #1538359) | Cod sursa (job #2481288) | Cod sursa (job #1856287)
#include <fstream>
using namespace std;
const int NMAX=50001;
int sums[NMAX];
int main()
{
ifstream in("secv2.in");
ofstream out("secv2.out");
int n, x, k, pos, maxim=-(1<<29), minim=(1<<29), st, en;
in>>n>>k;
for(int i=1; i<=n; i++)
{
in>>x;
sums[i]=sums[i-1]+x;
if(i>=k)
{
if(sums[i-k]<minim)
{
minim=sums[i-k];
pos=i-k+1;
}
if(sums[i]-minim>maxim)
{
maxim=sums[i]-minim;
en=i;
st=pos;
}
}
}
out<<st<<' '<<en<<' '<<maxim<<'\n';
return 0;
}