Cod sursa(job #1437649)

Utilizator TimoteiCopaciu Timotei Timotei Data 18 mai 2015 09:42:11
Problema Subsecventa de suma maxima Scor 85
Compilator cpp Status done
Runda Arhiva educationala Marime 0.54 kb
#include<fstream>
#define nmax 6000000
using namespace std;
int n,s[nmax],x,mn=999999999,mx=-99999999,p1,p2;
int main()
{
    ifstream f("ssm.in");
    ofstream g("ssm.out");
    f>>n;
    for(int i=1;i<=n;i++)
    {
        f>>x;
        s[i]=s[i-1]+x;
        if(s[i]>=mx){mx=s[i];p1=i;}
        if(s[i]<=mn){mn=s[i];p2=i;}
    }
    if(p1>p2)g<<s[p1]-s[p2]<<" "<<p2+1<<" "<<p1;
    else
    {  mn=99999999;
        for(int i=1;i<p1;i++)if(s[i]<mn){mn=s[i];p2=i;}
        g<<s[p1]-s[p2]<<" "<<p2+1<<" "<<p1;
    }
    return 0;
}