Pagini recente » Cod sursa (job #1219109) | Cod sursa (job #1874091) | Cod sursa (job #1419352) | Cod sursa (job #1542363) | Cod sursa (job #2473737)
#include <fstream>
using namespace std;
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int v[50001],sum[50001];
int main()
{ int n,k,pmax,umax,pc;
long long sc=0,smax=-2000000000;
in >> n >> k;
for(int i=1; i<=n; i++)
{ in >> v[i];
sum[i]=sum[i-1]+v[i];
if(i>=k&&sum[i]-sum[i-k]>sc+v[i])
{ sc=sum[i]-sum[i-k];
pc=i-k+1;
}
else sc+=v[i];
if(i>=k && sc>smax)
{ smax=sc;
pmax=pc;
umax=i;
}
}
out<<pmax<<" " << umax << " " << smax;
return 0;
}