Cod sursa(job #1174170)

Utilizator BlackLordFMI Alex Oprea BlackLord Data 22 aprilie 2014 11:35:05
Problema Subsecventa de suma maxima Scor 95
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <cstdio>
#define DIM 6000010
using namespace std;
int n, i, v[DIM], a[DIM], maxim, poz, p, u, pm, um;

inline int max(int x, int y){
    return (x>y?x:y);
}

int main(){
    freopen("ssm.in", "r", stdin);
    freopen("ssm.out", "w", stdout);
    scanf("%d", &n);
    for(i=1; i<=n; i++)
        scanf("%d", &v[i]);
    p=1;
    for(i=1; i<=n; i++)
    {
        a[i]=v[i]+a[i-1];
        u++;
        if(a[i]<v[i])
        {
            p=u=i;
            a[i]=v[i];
        }
        if(a[i]>maxim)
        {
            maxim=a[i];
            pm=p;
            um=u;
        }
    }
    printf("%d %d %d\n", maxim, pm, um);
    return 0;
}