Cod sursa(job #1474802)
| Utilizator | Data | 22 august 2015 23:32:13 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, k, x, a, sum;
int maxim=INT_MIN;
int l_lim, r_lim;
int main ()
{
f >> n;
for (k=0; k<n; k++)
{
f >> x;
if (sum < 0)
{
a = k+1;
sum = x;
}
else
sum = sum+x;
if (sum > maxim)
{
maxim = sum;
l_lim = a;
r_lim = k+1;
}
}
g << maxim << " " << l_lim << " " << r_lim;
return 0;
}