Cod sursa(job #2658919)

Utilizator Leonard123Mirt Leonard Leonard123 Data 15 octombrie 2020 14:26:53
Problema Secventa 2 Scor 70
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.68 kb
#include<fstream>
using namespace std;
 
ifstream cin ("secv2.in");
ofstream cout ("secv2.out");
 
int s[50005];
 
int main() {
    int n, k, x, pozin, pozsf, l, best;
    cin >> n >> k;
    for (int i = 1; i <= k; i++) {
        cin >> x;
        s[i] = s[i - 1] + x;
    }
    best = s[k];
    pozin = 1;
    pozsf = k;
    int in = 1;
    for (int i = k + 1; i <= n; i++) {
        cin >> x;
        s[i] = s[i - 1] + x;
        if (s[i - k + 1] - s[in - 1] <= 0) {
            in = i - k + 1;
        }
        if(s[i] - s[in - 1] > best){
            best = s[i] - s[in - 1];
            pozin = in;
            pozsf = i;
        }
    }
    cout << pozin << " " << pozsf << " " << best;
}