Cod sursa(job #2031304)
| Utilizator | Data | 2 octombrie 2017 23:20:26 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n; in >> n;
int a[n];
for(int i=1; i<=n; i++) in >> a[i];
int sum=0, best=0, st=0, dr=n;
for(int i=1; i<n; i++)
{
if ( sum +a[i] < a[i] )
{
sum = a[i] ;
st = dr = i;
}
else sum +=a[i];
if ( sum +a[i] > best ) dr++ , best = sum;
}
out << best<<' ' << st<<' ' << dr;
return 0;
}
