Cod sursa(job #1852980)
| Utilizator | Data | 21 ianuarie 2017 12:27:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,s,best = -int(2e9),l,r,ind,sum;
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> s;
if(sum < 0)
sum = s,ind = i;
else
sum += s;
if(best < sum)
best = sum,l = ind,r = i;
}
fout << best << ' ' << l << ' ' << r << '\n';
fin.close();
fout.close();
return 0;
}
