Cod sursa(job #1098297)
| Utilizator | Data | 4 februarie 2014 18:26:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream is ("ssm.in");
ofstream os ("ssm.out");
int n, s, s2, x;
int Best, Base, I, J;
int main()
{
is >> n;
Best = -2e9;
for (int i = 1; i <= n; ++i)
{
is >> x;
s += x;
if (s < Base)
I = i, Base = s;
if (s - Base > Best)
Best = s - Base, J = i;
//os << s << ' ';
}
os << Best << ' ' << I+1 << ' ' << J;
is.close();
os.close();
return 0;
}
