Cod sursa(job #1337960)

Utilizator goalexboxerFMI Alexandru Ionascu goalexboxer Data 9 februarie 2015 17:48:41
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include<stdio.h>
#define MAXSIZE 6000001
#define FIN "ssm.in"
#define FOUT "ssm.out"

int n;
int v[MAXSIZE];
int best[MAXSIZE];

int main()
{
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);

    scanf("%d", &n);

    for(int i=1;i<=n;i++)
    {
        scanf("%d ", &v[i]);
    }
    int begin = 1;
    int end = 1;
    int maxx = v[1];

    int count = 0;

    best[1] = v[1];
    for(int i=2;i<=n;i++)
    {

        if(best[i-1] + v[i] > v[i])
        {
            best[i] = best[i-1] + v[i];

            count++;

            if(best[i] > maxx)
            {
                maxx = best[i];
                end = i;
            }



        }
        else
        {
            best[i] = v[i];
            count = 0;
        }

    }

    printf("%d %d %d", maxx, end - count + 1, end);

    return 0;

}