Files
Data-Structure/Exercise/Extra/最大连续子序列.cpp
e2hang dc879776b1 New
2025-10-24 17:40:20 +08:00

44 lines
761 B
C++

#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> arr(n), dp(n);
for(int i = 0; i < n; i++){
cin >> arr[i];
}
dp[0] = arr[0];
int smax = -1;
bool hasans = false;
for(int i = 1; i < n; i++){
dp[i] = max(dp[i - 1] + arr[i], arr[i]);
if(dp[i] >= 0) hasans = true;
if(dp[i] > smax) smax = dp[i];
}
if(!hasans){
cout << "0" << endl;
cout << "-1" << " " << "-1" << endl;
return 0;
} else{
int js = -1;
for(int i = 0; i < n; i++){
if(dp[i] == smax) {
js = i;
break;
}
}
int sum = 0;
for(int i = js; i >= 0; i--){
sum += arr[i];
if(sum == smax){
sum = i;
cout << smax << endl;
cout << sum << " " << js << endl;
return 0;
}
}
}
return 0;
}