Cod sursa(job #2214894)
Utilizator | Data | 20 iunie 2018 14:51:59 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,l,L,R,ans,x,n,best;
int main()
{
f>>n;
f>>best;
ans=best;
l=1;
for(i=2;i<=n;++i)
{
f>>x;
if(best>0) best += x;
else l = i, best = x;
if(best > ans)
{
ans = best;
L = l;
R = i;
}
}
g<<ans<<' '<<L<<' '<<R<<'\n';
return 0;
}