Pagini recente » Cod sursa (job #1819735) | Cod sursa (job #2706288) | Cod sursa (job #2258413) | Cod sursa (job #3208998) | Cod sursa (job #1554373)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,i,a[50005],s[50005],minim,maxim,pmax,umax,p;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
s[i]=s[i-1]+a[i];
}
minim = 1000000;
maxim=-25005;
for(i=k;i<=n;i++)
{
if(s[i-k] < minim){
minim = s[i-k];
p=i-k;
}
if (s[i] - minim > maxim)
{
maxim = s[i] - minim;
pmax=p;
umax=i;
}
}
fout<<pmax+1<<" "<<umax<<" "<<maxim;
return 0;
}