Pagini recente » Cod sursa (job #3270275) | Cod sursa (job #2601046) | Cod sursa (job #3252222) | Cod sursa (job #1555587) | Cod sursa (job #3238917)
#include <bits/stdc++.h>
#define MAXN 50000
#defint int long long
using namespace std;
int mins[2][MAXN + 1];
int sp[MAXN + 1];
signed main() {
ifstream cin( "secv2.in" );
ofstream cout( "secv2.out" );
int n , k , i , s , a , maxi , st , dr;
cin >> n >> k;
s = 0;
mins[0][0] = LONG_MAX;
mins[0][1] = 0;
for( i = 1 ; i <= n ; i++ ) {
cin >> a;
s += a;
if( s < mins[0][i - 1] ) {
mins[0][i] = s;
mins[1][i] = i;
} else {
mins[0][i] = mins[0][i - 1];
mins[1][i] = mins[1][i - 1];
}
sp[i] = s;
}
maxi = LONG_MIN;
st = dr = 0;
for( i = k ; i <= n ; i++ )
if( sp[i] - mins[0][i - k + 1] > maxi ) {
maxi = sp[i] - mins[0][i - k + 1];
st = mins[1][i - k + 1] + 1;
dr = i;
}
cout << st << ' ' << dr << ' ' << maxi << '\n';
return 0;
}