Cod sursa(job #2359526)

Utilizator FrequeAlex Iordachescu Freque Data 28 februarie 2019 21:45:55
Problema Subsecventa de suma maxima Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.2 kb
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define enter cout << '\n'

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <int> vi;
typedef vector <pii> vii;
typedef vector <ll> vl;
typedef vector <pll> vll;
typedef queue <int> qi;
typedef queue <pii> qii;
typedef queue <ll> ql;
typedef queue <pll> qll;

const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 9;
const double EPSILON = 1e-10;
const int NMAX = 6e6 + 5;

ifstream fin("ssm.in");
ofstream fout("ssm.out");

int main()
{
    int n, l = 0, r = 0, best = 0, best_l, best_r, sum = 0;

    fin >> n;
    for (int i = 1; i <= n; ++i)
    {
        int x;
        fin >> x;

        if (sum <= 0)
        {
            sum = x;
            l = r = i;
        }
        else
        {
            sum += x;
            ++r;
        }

        if (best < sum)
        {
            best = sum;
            best_l = l;
            best_r = r;
        }
    }

    fout << best << " " << best_l << " " << best_r;

    return 0;
}