Pagini recente » Cod sursa (job #714596) | Cod sursa (job #591372) | Cod sursa (job #2136802) | Cod sursa (job #2325129) | Cod sursa (job #3286471)
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n, k;
long long a[50001], sp[50001];
long long s, sultim, maxim = -100000000000000, st, dr;
int main(){
f >> n >> k;
int poz = 1;
for (int i = 1; i <= n; i++){
f >> a[i];
if(s < sultim) {
s = sultim;
poz = i - k + 1;
}
s += a[i];
sultim += a[i];
if(i - k + 1 >= 1) {
sultim -= a[i - k + 1];
}
if(s > maxim && i >= k) {
maxim = s;
st = i;
dr = poz;
}
}
g << dr << " " << st <<" " << maxim;}