Cod sursa(job #2383860)
| Utilizator | Data | 19 martie 2019 20:46:27 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <limits.h>
using namespace std;
int n, p, first, last, smax = INT_MIN, sum, i, x;
ifstream f("smm.in");
ofstream g("smm.out");
int main()
{
f >> n;
for(i = 1; i <= n; i ++)
{
f >> x;
if(sum < 0)
{
sum = x;
p = i;
}
else sum += x;
if(sum > smax)
{
smax = sum;
first = p;
last = i;
}
}
g << smax << " " << first << " " << last;
return 0;
}
