Cod sursa(job #1516309)
| Utilizator | Data | 2 noiembrie 2015 22:28:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int v[6000001], i, n, s, inceput, sfarsit, p, maxim;
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
s=v[1];
maxim=v[1];
p=1;
for(i=2; i<=n; i++)
{
s+=v[i];
if(s<v[i])
{
p=i;
s=v[i];
}
if(s>maxim)
{
maxim=s;
inceput=p;
sfarsit=i;
}
}
out<<maxim<<' '<<inceput<<' '<<sfarsit<<'\n';
return 0;
}
