Cod sursa(job #2181827)
| Utilizator | Data | 21 martie 2018 21:10:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int curr,n,sum,start,best = -1<<30;
int main()
{
ios::sync_with_stdio(0);
in >> n;
int st, dr, start;
for(int i=1; i<=n; i++)
{
in >> curr;
if( sum < 0 )
{
start = i;
sum = curr;
} else sum += curr;
if( sum > best )
{
st = start;
dr = i;
best = sum;
}
}
out << best << ' ' << st << ' '<< dr ;
return 0;
}
