Cod sursa(job #2849253)
Utilizator | Data | 14 februarie 2022 19:20:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int sir[6000005];
int main() {
int n, i, s, smax= -2147483647, ok, st, dr;
fin>>n;
for(i=1; i<=n; ++i)
fin>>sir[i];
s=0;
for(i=1; i<=n; ++i) {
if (s<0) {
s=0;
ok=i;
}
s+=sir[i];
if (s>smax) {
smax=s;
st=ok;
dr=i;
}
}
fout<<smax<<" "<<st<<" "<< dr;
return 0;
}