Cod sursa(job #2633129)

Utilizator OvidRata Ovidiu Ovid Data 6 iulie 2020 15:52:49
Problema Subsecventa de suma maxima Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.95 kb
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll
ifstream fin("ssm.in"); ofstream fout("ssm.out");
#define cin fin
#define cout fout

int n, a;
int s=0, sm=0;

int32_t main(){
INIT
cin>>n;
int lm=0, b=0;
int l=0;



for(int i=1; i<=n; i++){
    cin>>a;
    if( (s+a)>0 ){
        l++; s+=a;
        if(s>sm){
            sm=s; b=i-l+1; lm=l;
        }
    }
    else{

            if(b==0){
                s+=a;
                    l++;
                b=i-l+1;
                sm=s;
                lm=l;
            }

        l=0;
        s=0;
    }
}
cout<<sm<<" "<<b<<" "<<b+lm-1;

return 0;
}