Pagini recente » Rezultatele filtrării | Cod sursa (job #2643088)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <limits.h>
using namespace std;
int n, k, nr, v[50005], maxim = INT_MIN, minim = 0, posMinim = 0;
pair<int,int> posMaxim;
int main(){
ifstream fin("secv2.in");
ofstream fout("secv2.out");
fin >> n >> k;
for(int i = 1; i <= n; ++i){
fin >> nr;
v[i] += v[i-1] + nr;
}
for(int i = 1; i <= n - k + 1; ++i){
if(minim > v[i-1]){
minim = v[i-1];
posMinim = i-1;
}
if(maxim < v[i + k - 1] - v[posMinim]){
maxim = v[i + k - 1] - v[posMinim];
posMaxim.first = i + k - 1;
posMaxim.second = posMinim + 1;
}
}
fout << posMaxim.second << " " << posMaxim.first << " " << maxim ;
return 0;
}