Cod sursa(job #2116822)

Utilizator randiboyPucani Catalin randiboy Data 28 ianuarie 2018 00:04:22
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <fstream>
#include <limits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n;
int a[6000001];
int b[6000001];
int maxi=-100000000,mini=INT_MAX;

int main()
{
    int poz1,poz2;
    f>>n;
    for(int i=1;i<=n;i++)
        f>>a[i];
    b[1]=a[1];
    for(int i=2;i<=n;i++)
        b[i]=b[i-1]+a[i];
    for(int i=1;i<=n;i++)
        {
            if(b[i]>maxi)
            {
                 maxi=b[i];
                 poz1=i;
            }
        }
    for(int i=poz1;i>=1;i--)
    {
        if(b[i]<mini)
        {
            mini=b[i];
            poz2=i;
        }
    }
    g<<maxi-mini<<" "<<poz2+1<<" "<<poz1;
    return 0;
}