Cod sursa(job #2374363)
Utilizator | Ababei Daniel Googal | Data | 7 martie 2019 18:10:23 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int INF = 1 << 30;
int n;
int smax = -INF;
int imax, jmax;
int csum;
int ci, cj;
int main()
{
in >> n;
for(int i = 1; i <= n; i++) {
int x;
in >> x;
if(csum < 0) {
csum = 0;
ci = i;
}
csum += x;
if(smax < csum) {
smax = csum;
imax = ci;
jmax = i;
}
}
out << smax << ' ';
out << imax << ' ' << jmax << '\n';
in.close();
out.close();
return 0;
}