Cod sursa(job #2472258)
Utilizator | Data | 12 octombrie 2019 10:41:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int N,s=0,L=0,smax=0,st=0,dr=0,sf=0,nr;
f>>N;
for (int i=1;i<=N;i++)
{
f>>nr;
if(s+nr>=nr) s=s+nr;
else {s=nr;
L=i;}
if(s>smax)
{
smax=s;
st=L;
dr=i;
}
else if( s>=smax && L<st) {st=L;dr=i;}
}
g<<smax<<' '<<st<<' '<<dr;
return 0;
}