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