Cod sursa(job #2472219)
| Utilizator | Data | 12 octombrie 2019 10:33:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int smax = 1 >> 30, l, st, nr, n, dr;
void citire() {
int s = 0;
f >> n;
for(int i = 1; i <= n; ++i) {
f >> nr;
if(s + nr >= nr)
s += nr;
else
s = nr, l = i;
if(s > smax)
smax = s, st = l, dr = i;
else
if(s >= smax && l < st)
st = l, dr = i;
}
g << smax << ' ' << st << ' ' << dr;
}
int main()
{
citire();
f.close();
g.close();
return 0;
}
