Pagini recente » Cod sursa (job #2606557) | Cod sursa (job #980108) | Cod sursa (job #2294680) | Cod sursa (job #1429538) | Cod sursa (job #1150909)
#include <fstream>
using namespace std;
int v[50001], sum[50001];
int main()
{
ifstream in("secv2.in");
ofstream out("secv2.out");
int n, k, i, sc = 0, stc, smax, stmax = 1, drmax, pozmin = 1, pozmax;
in >> n >> k;
in >> v[1];
sum[1] = v[1];
for ( i = 2; i <= n; i++ )
{
in >> v[i];
sum[i] = sum[i-1] + v[i];
}
smax = sum[k];
stc = sum[k];
pozmax = k;
drmax = k;
for ( i = k; i <= n; i++ )
{
if ( sum[i] - sum[i-k] > stc + v[i] )
{
stc = sum[i] - sum[i-k];
pozmin = i-k+1;
pozmax = i;
}
else
{
stc+=v[i];
pozmax = i;
}
if ( stc > stmax )
{
stmax = pozmin;
drmax = pozmax;
smax = stc;
}
}
out << stmax<<' '<< drmax << ' '<< smax;
return 0;
}