Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main () {
- int n, x = 0, s = 0, pos1 = 0, pos2 = 0;
- cin >> n;
- int mas[n];
- for(int k = 0; k < n; k++)
- cin >> mas[k];
- for(int k = 0; k < n - 1; k++) {
- if ((mas[k + 1] > mas[k]) && (x != 1)) {
- pos1 = k;
- x = 1;
- }
- if ((mas[k + 1] > mas[k]) && (x == 1))
- pos2 = k;
- }
- pos2++;
- s = pos2 - pos1 + 1;
- cout << pos1 << " " << pos2 << "\n";
- if ((s == 2)&&(x==0))
- cout << "-1";
- else
- cout << s;
- }
- /*#include <iostream>
- using namespace std;
- int main () {
- int n, max, min;
- cin >> n;
- int mas[n];
- for (int k = 0; k < n; k++)
- cin >> mas[k];
- max = mas[0];
- min = mas[0];
- for (int k = 0; k < n; k++)
- if ((mas[k] > max) && (mas[k] % 2 == 0))
- max = mas[k];
- for (int k = 0; k < n; k++)
- if ((mas[k] < min) && (mas[k] % 2 == 1))
- min = mas[k];
- cout << min;
- cout << "\n";
- cout << max;
- }
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement