Cod sursa(job #3303681)

Utilizator AbC_LTAVPopovici Andrei AbC_LTAV Data 17 iulie 2025 11:05:52
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <iostream>
#include <vector>

using namespace std;

const int Max = 6e6;
vector <int> Sum;

int main()
{
    int n, X, minSum, maxSum, St = 1, Dr = 1;

    cin >> n;

    Sum.resize(n + 1);

    for (int i = 1; i <= n; i++)
    {
        cin >> X;

        Sum[i] = X + Sum[i - 1];
    }

    maxSum = Sum[1];

    for (int i = 1; i <= n; i++)
    {
        if (maxSum < Sum[i] - minSum)
        {
            maxSum = Sum[i] - minSum;

            Dr = i;
        }


        if (minSum > Sum[i])
        {
            minSum = Sum[i];

            St = i;
        }
    }

    cout << maxSum << ' ' << St << ' ' << Dr;

    return 0;
}