Cod sursa(job #2974337)
| Utilizator | Data | 3 februarie 2023 21:11:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main(){
vector<int>v;
int n;
int sum = 0;
int sum_max = 0;
int st,dr;
cin >> n;
int x;
for(int i = 0; i < n; i++){
cin >> x;
v.push_back(x);
}
for(int i = 1; i < n; i++){
for(int j = i; j < n; j++){
sum = sum + v[j];
if(sum > sum_max){
sum_max = sum;
st = i;
dr = j;
}
}
}
cout << sum_max << " " << st << " " << dr;
return 0;
}
