Cod sursa(job #3159306)
| Utilizator | Data | 21 octombrie 2023 09:20:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-32 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main(){
int n, x;
fin >> n;
int best = 0;
int sumMax = -2147483647;
int indSt = 0, indDr = 0;
int lung = 1;
for(int i = 1; i <= n; i++){
fin >> x;
if(x + best > x){
best += x;
lung++;
}
else{
best = x;
lung = 1;
}
if(best > sumMax){
sumMax = best;
indDr = i;
indSt = indDr - lung + 1;
}
}
fout << sumMax << " " << indSt << " " << indDr;
return 0;
}
