Cod sursa(job #1901437)
| Utilizator | Data | 3 martie 2017 22:52:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main (){
int n,x;
fin >> n;
int sum = 0;
int start_poz;
int fin_poz;
int aux;
fin >> x;
int best = x;
sum = x;
for (int i = 2; i <= n; ++i){
fin >> x;
if (sum + x < x){
sum = x;
aux = i;
}
else sum += x;
if (best<sum){
best = sum;
start_poz = aux;
fin_poz = i;
}
}
fout << best << " " << start_poz << " " << fin_poz << "\n";
}
