Cod sursa(job #3242931)
| Utilizator | Data | 14 septembrie 2024 17:35:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <climits>
std::ifstream bem("ssm.in");
int n;
std::ofstream kim("ssm.out");
void ssm(){
int best = 0, elem, most = 1, max = INT_MIN, kezdet = 1, vege = 1;
for(int i = 1; i <= n; i++){
bem >> elem;
if(best + elem >= elem)
best += elem;
else{
best = elem;
most = i;
}
if(best > max){
max = best;
kezdet = most;
vege = i;
}
}
kim << max << " " << kezdet << " " << vege << "\n";
}
int main(){
bem >> n;
ssm();
bem.close();
kim.close();
return 0;
}
