Cod sursa(job #2472269)
Utilizator | Data | 12 octombrie 2019 10:45:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int st, sf, s, nr, l, n, i, dr;
int main()
{
f>>n;
int smax=-2000000;
for(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;
}