Mai intai trebuie sa te autentifici.
Cod sursa(job #2669030)
| Utilizator | Data | 5 noiembrie 2020 22:05:58 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
void maximum_sum_subarray (int arr[],int n){
int current_max=0, maximum_so_far=0, first_index, last_index, idx;
for (int i=1;i<=n;i++){
if (current_max < 0){
current_max = arr[i];
idx=i;
}
else
current_max=current_max+arr[i];
if (current_max>maximum_so_far){
maximum_so_far=current_max;
first_index=idx;
last_index=i;
}
}
fout<<maximum_so_far<<" "<<first_index<<" "<<last_index;
}
int main() {
int arr[100],n,i;
fin>>n;
for (i=1;i<=n;i++)
fin>>arr[i];
maximum_sum_subarray(arr,n);
}
