Pagini recente » Cod sursa (job #1504598) | Cod sursa (job #1856544) | Cod sursa (job #1567193) | Cod sursa (job #962767) | Cod sursa (job #1566874)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,k,i,x,sum[50001],sc,smax=-2000000,st,stmax=-2000000,drmax,nr=0,v;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
sum[0]=0;
for(i=1; i<=n; i++)
{
f>>v;
sum[i]=sum[i-1]+v;
}
for(i=1; i<=n; i++)
{
f>>x;
sum[i]=sum[i-1]+x;
if(i<k)
continue;
if(i==k)
{
sc=sum[i];
st=1;
}
else
{
if(sum[i]-sum[i-k]>sc+x)
{
sc=sum[i]=sum[i-k];
st=i-k+1;
}
else sc+=x;
}
if(sc>smax and nr>=k)
{
smax=sc;
stmax=st;
drmax=i;
}
}
g<<stmax<<" "<<drmax<<" "<<smax;
return 0;
}