Pagini recente » Cod sursa (job #1171415) | Cod sursa (job #2534112) | Cod sursa (job #2439941) | Cod sursa (job #2140486) | Cod sursa (job #1218354)
# include <fstream>
# include <iostream>
# define infi 0x3f3f3f3f
# define nmax 50005
using namespace std;
ifstream fi("secv2.in");
ofstream fo("secv2.out");
long long Max=-infi;
int pr,u;
int s[nmax],p[nmax],sum[nmax];
int main(void)
{
int n,k;
fi>>n>>k;
int x;
fi>>x;
sum[1]=s[1]=x;p[1]=1;
for (int i=2;i<=n;++i)
{
fi>>x;
sum[i]=sum[i-1]+x;
if (s[i-1]<0 ) p[i]=i,s[i]=x;
if (s[i-1]>=0) p[i]=p[i-1],s[i]=x+s[i-1];
}
for (int i=k;i<=n;++i)
{
int S=sum[i]-sum[i-k+1]+s[i-k+1];
if (S>Max) Max=S,pr=p[i-k+1],u=i;
}
fo<<pr<<" "<<u<<" "<<Max<<"\n";
}