Cod sursa(job #2831813)
Utilizator | Data | 12 ianuarie 2022 10:50:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int sir[6000000];
int main()
{
int n, i, s, smax, ok, st, dr;
in>>n;
for(i=1; i<=n; ++i)
in>>sir[i];
s=smax=0;
for(i=1; i<=n; ++i)
{
if (s<0)
{
s=0;
ok=i;
}
s+=sir[i];
if (s>smax)
{
smax=s;
st=ok;
dr=i;
}
}
out<<smax<<" "<<st<<" "<< dr;
return 0;
}