Cod sursa(job #1584439)

Utilizator BourucLiviuBouruc Petru Liviu BourucLiviu Data 30 ianuarie 2016 09:26:50
Problema Subsecventa de suma maxima Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <fstream>
using namespace std;

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

#define INFINIT 0x3f3f3f3

int sum[6000000], best[6000000];

int main()
{
    int n, x, Min, bestSum, pozMin, pozMax;
    fin >> n;
    for(int i = 1; i <= n; i++)
    {
        fin >> x;
        sum[i] = x + sum[i-1];
    }
    Min = sum[0];
    pozMin = pozMax = 1;
    bestSum = -INFINIT;
    for(int i = 1; i <= n; i++)
    {
        best[i] = sum[i] - Min;
        if(Min > sum[i])
        {
            Min = sum[i];
            pozMin = i + 1;
        }
        if(bestSum < best[i])
        {
            bestSum = best[i];
            pozMax = i;
        }
    }
    fout << bestSum << " " << pozMin << " " << pozMax;
    return 0;
}