Cod sursa(job #895521)

Utilizator pulseOvidiu Giorgi pulse Data 27 februarie 2013 11:40:50
Problema Subsecventa de suma maxima Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include<fstream>
#define nmax 6000001
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");

int maxim(int a, int b)
{
    if(a>=b) return a;
    else return b;
}

int n,i,v[nmax],best[nmax],k,first=1,last=1,m;
int main()
{
    f>>n;
    for(i=1;i<=n;i++) f>>v[i];
    best[1]=v[1];
    m=v[1];
    for(i=2;i<=n;i++)
    {
        if(v[i]>v[i]+best[i-1])
        {
            best[i]=v[i];
            k=i;
        }
        else
        {
            best[i]=v[i]+best[i-1];
        }
        if(best[i]>m)
        {
            m=best[i];
            first=k;
            last=i;
        }
    }
    g<<m<<" "<<first<<" "<<last<<"\n";
    f.close();g.close();
    return 0;
}