Cod sursa(job #3174390)
| Utilizator | Data | 24 noiembrie 2023 18:36:34 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int n;
int v[60000005];
int main(){
ifstream f("ssm.in");
ofstream g("ssm.out");
f >> n;
int sol = 0, sum = 0, poz_i, poz_j, poz_current;
for(int i = 1; i <= n; i++){
int s;
f >> s;
if(sum < 0){
sum = s;
poz_current = i;
}
else{
sum += s;
}
if(sol < sum){
sol = sum;
poz_i = poz_current;
poz_j = i;
}
}
g << sol << ' ' << poz_i << ' ' << poz_j;
}