Cod sursa(job #2589361)
| Utilizator | Data | 26 martie 2020 11:09:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int c[100];
ifstream in("sumesecv.in");
ofstream out("sumesecv.out");
int main()
{
int n, sc = -1, smax = -1<<30, x, poz1, poz2, pmax, umax;
in >> n;
for (int i = 1; i <= n; i++){
in >> x;
if (sc < 0){
sc = 0;
poz1 = i;
}
sc += x;
if (sc > smax){
smax = sc;
pmax = poz1;
umax = i;
}
}
out << smax << " " << pmax << " " << umax;
return 0;
}
