Cod sursa(job #1252324)
| Utilizator | Data | 30 octombrie 2014 17:34:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <iostream>
using namespace std;
int i, n, bestSum = -int(2e9), sum, s, poz, beg, last;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
cin>>n;
for(i = 1; i <= n; ++i)
{
cin>>s;
if(sum < 0)
{
sum = s;
poz = i;
}
else
sum += s;
if(bestSum < sum)
{
bestSum = sum;
beg = poz;
last = i;
}
}
cout<<bestSum<<" "<<beg<<" "<<last;
return 0;
}