Cod sursa(job #2760414)

Utilizator tryharderulbrebenel mihnea stefan tryharderul Data 26 iunie 2021 10:27:29
Problema Subsecventa de suma maxima Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.69 kb
#include <bits/stdc++.h>

using namespace std;

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

int n;

int main(){
    InParser in("ssm.in");
    freopen("ssm.out", "w", stdout);
    in>>n;
    int hmax = -int(2e9),st,dr,l,s=0;
    for(int i=1;i<=n;i++){
        int x;
        in>>x;
        if(x > x + s) {
            s = x;
            l = i;
        }else{
            s += x;
        }
        if(hmax < s){
            hmax = s;
            st = l;
            dr = i;
        }
    }
    printf("%d %d %d",hmax,st,dr);

    return 0;
}