Cod sursa(job #2434396)
Utilizator | Popescu Stefan stefan.popescu | Data | 1 iulie 2019 17:56:07 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ssm.in");
ofstream out("ssm.out");
long long int n, i, pozj, pozinit, pozfin, si, minsj=2000000000, x, smax=-2000000000;
int main()
{
in>>n;
for(i=1; i<=n; i++)
{
in>>x; si+=x;
if(si-minsj>smax)
{
smax=si-minsj;
pozfin=i;
pozinit=pozj;
}
if(minsj>si)
{
minsj=si;
pozj=i+1;
}
}
out<<smax<<" "<<pozinit<<" "<<pozfin;
return 0;
}