Pagini recente » Cod sursa (job #1515671) | Cod sursa (job #2792984) | Cod sursa (job #2327612) | Cod sursa (job #240482) | Cod sursa (job #1669117)
#include <fstream>
#include <iostream>
int s[5000000];
using namespace std;
ifstream in ( "secv2.in" );
ofstream out ( "secv2.out" );
int main()
{
int n, k, i, smax, sc, pc, umax, x, pmax;
in>>n>>k;
s[0] = 0;
for ( i = 1; i <= k; i++ ) {
in>>x;
s[i] = s[i-1] + x;
}
smax = sc = s[k];
pc = pmax = 1;
umax = k;
for ( ; i <= n; i++ ) {
in>>x;
s[i] = s[i-1] + x;
if ( s[i] - s[i-k] > sc + x ) {
sc = s[i] - s[i-k];
pc = i - k + 1;
}
else {
sc = sc + x;
}
if ( sc > smax )
{
smax = sc;
pmax = pc;
umax = i;
}
}
out << pmax <<" "<<umax << " " << smax;
return 0;
}