Cod sursa(job #1499934)

Utilizator SlevySlevoaca Stefan-Gabriel Slevy Data 11 octombrie 2015 12:32:19
Problema Subsecventa de suma maxima Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <fstream>

using namespace std;

ifstream in("ssm.in");
ofstream out("ssm.out");
int n;
int *p;

int main()
{
    in>>n;
    p = new int[n+1];
    long long int x;
    long long int maxx = -1;
    int pozi = -1,pozf = -1;
    int pi = -1,pf =-1;
    in>>x;
    p[1] = x;
    pozi = 1;
    pozf = 1;
    for(int i=2;i<=n;i++)
    {
        in>>x;
        if(p[i-1]+x>x)
        {
            p[i] = p[i-1]+x;
           pozf++;
        }
        else
        {
            p[i] = x;
           pozi = i;
           pozf = i;
        }
          if(maxx<p[i])
        {
            maxx = p[i];
            pi = pozi;
            pf = pozf;
        }
    }
    out<<maxx<<" "<<pi<<" "<<pf<<'\n';
    delete[] p;
    return 0;
}