Cod sursa(job #2762576)

Utilizator DariusMDarius Feher DariusM Data 8 iulie 2021 15:10:13
Problema Secventa 2 Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.67 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream f("secv2.in");
ofstream g("secv2.out");

const int maxN = 50001;
int pSums[maxN];
int main() {
    int n, mini = INT_MAX, maxi = INT_MIN, st, end, stMin, x, k;
    f >> n >> k;
    st = end = 0;
    for (int i = 1; i <= n; i++) {
        f >> x;
        pSums[i] = pSums[i - 1] + x;
    }
    for (int i = k; i <= n; i++) {
        if (mini > pSums[i - k]) {
            mini = pSums[i - k];
            stMin = i - k;
        }
        if (pSums[i] - mini > maxi) {
            maxi = pSums[i] - mini;
            end = i;
            st = stMin + 1;
        }
    }
    g << st << " " << end << " " << maxi << "\n";
}