Cod sursa(job #1998717)
Utilizator | Ginga Tudor-Adrian JustGinga | Data | 8 iulie 2017 21:40:47 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream in ("ssm.in");
ofstream out ("ssm.out");
int n, x, s, p, MAX = -0x3F3F3F3F, MIN, st, dr;
int main()
{
in >> n;
for (int i = 1; i <= n; i++)
{
in >> x; s += x;
if (MAX < s - MIN)
{
MAX = s - MIN;
st = p + 1; dr = i;
}
if (s < MIN)
{
MIN = s; p = i;
}
}
out << MAX << " " << st << " " << dr << '\n';
out.close(); return 0;
}