Cod sursa(job #629821)
| Utilizator | Data | 4 noiembrie 2011 00:33:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#define INF 0x3f3f3f3f
using namespace std;
inline int max(int a, int b)
{
return (a>b)?a:b;
}
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, best = 0, i, beg, end, maxim = -INF, idx, x;
fin >> n;
for (i=1; i<=n; ++i) {
fin >> x;
if (best < 0)
best = x, idx = i;
else
best += x;
if (best > maxim) {
maxim = best;
beg = idx;
end = i;
}
}
fout << maxim << " " << beg << " " << end;
return 0;
}
