Cod sursa(job #2032369)
| Utilizator | Data | 4 octombrie 2017 21:25:32 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long sum, best, st=1, dr=1, inceput;
int main()
{
int n; in >> n;
in >> cur; best = cur;
for(int i=1; i<n; i++)
{
int curr;in >> curr;
if ( sum < 0 )
{
inceput = i;
sum = curr;
}else
sum += curr;
if( sum > best)
{
best = sum;
st = inceput;
dr = i;
}
}
if( best>=0 ) out << best <<' ' << st<<' ' << dr; else out << 0;
return 0;
}
