Cod sursa(job #1525160)

Utilizator TonyFrumTony Frum TonyFrum Data 14 noiembrie 2015 19:49:40
Problema Subsecventa de suma maxima Scor 65
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
//#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long int s[6000001],b[6000001],a[2][6000001];
int main()
{
    int n,i,r,mini,z,maxi;
    f>>n;
    for(i=1;i<=n;i++)
        f>>s[i];
    b[n]=s[n];
    for(i=n-1;i>=1;i--)
        b[i]=b[i+1]+s[i];
    a[0][n]=b[n];
    a[1][n]=n+1;
    r=1;
    mini=0;
    z=n;
    maxi=a[0][1];
    for(i=n-1;i>=1;i--)
    {
        if(b[i+1]<=mini)
        {
            mini=b[i+1];
            z=i;
        }
        a[0][i]=b[i]-mini;
        a[1][i]=z;
    }
    for(i=2;i<=n;i++)
    {
        if(maxi<a[0][i])
        {
            r=i;
            maxi=a[0][i];
        }
    }
    g<<a[0][r]<<" "<<r<<" "<<a[1][r];
    f.close();
    g.close();
    return 0;
}