Cod sursa(job #2977259)
| Utilizator | Data | 11 februarie 2023 10:08:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000000];
int main(){
int N; fin>>N;
int f,l;
for(int i = 0; i < N; i++){
fin>>a[i];
}
int max_num = -2000000000;
for(int i = 0; i < N; i++){
int temp_num = 0;
for(int j = i; j < N; j++){
temp_num += a[j];
if(temp_num > max_num){
max_num = temp_num;
f = i;
l = j;
}
}
}
fout<<max_num<<" "<<f+1<<" "<<l+1;
return 0;
}
