Pagini recente » Cod sursa (job #619743) | Cod sursa (job #840569) | Cod sursa (job #2532043) | Cod sursa (job #2266822) | Cod sursa (job #2377288)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int v[50001];
int 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;
}