Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int main() {
- int n;
- cin >> n;
- int Array[10*1000 + 1];
- Array[0] = 0;
- for (int *q = Array + 1; q <=Array + n; q++) {
- cin >> *q;
- *q += *(q - 1);
- }
- int ans_left, ans_right, max_sum = 0;
- int min_left[10*1000 + 1];
- min_left[0] = 0;
- for (int i = 1; i <= n; i++) {
- if (Array[min_left[i - 1]] < Array[i - 1] && Array[i] > Array[min_left[i - 1]])
- min_left[i] = min_left[i - 1];
- else if (Array[i] > Array[i - 1] && Array[i - 1] <= Array[min_left[i - 1]])
- min_left[i] = i - 1;
- else
- min_left[i] = i;
- }
- for (int i = 1; i <= n; i++) {
- if (Array[i] - Array[min_left[i]] > max_sum) {
- max_sum = Array[i] - Array[min_left[i]];
- ans_left = min_left[i] + 1;
- ans_right = i;
- }
- }
- cout << ans_left << " " << ans_right;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement