Pagini recente » Cod sursa (job #862607) | Arhiva de probleme | Cod sursa (job #1523788) | Cod sursa (job #3229569) | Cod sursa (job #590469)
Cod sursa(job #590469)
#include<fstream.h>
long n,k,t,i,s=0,b=0,max=-2000000000,p=1,l=1,j=1,v=0;
int main()
{ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
{f>>t;
v+=t;
if(b>s)
b=s,l=i;
s+=t;
if(max<s-b&&i>=l+k)
max=s-b,p=i;
if(l<=p)
j=l;}
if(k==n)
g<<"1 "<<n<<" "<<v;
else
g<<j<<" "<<p<<" "<<max;
f.close();
g.close();
return 0;}