Pagini recente » Cod sursa (job #1655165) | Cod sursa (job #607961) | Cod sursa (job #491906) | Cod sursa (job #1963381) | Cod sursa (job #2377291)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int v[50001], sum[50001];
int main()
{
int n, i, k, q, p, sc, pc=1, smax, pmax, umax;
in >> n >> k;
smax=-2000000000;
sc=0;
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;
}