Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits\stdc++.h>
- using namespace std;
- int main()
- {
- int n;
- scanf("%d", &n);
- int a[n], b[n], i, j;
- for(i = 0; i < n; i++)
- {
- scanf("%d", &a[i]);
- b[i] = a[i];
- }
- sort(b, b+n);
- int l = n, r = -1;
- for(i = 0; i < n; i++)
- {
- if(a[i] != b[i])
- {
- l = i;
- break;
- }
- }
- if(l == n)
- {
- printf("yes\n1 1\n");
- return 0;
- }
- for(i = n-1; i >= 0; i--)
- {
- if(a[i] != b[i])
- {
- r = i;
- break;
- }
- }
- for(i = l, j = r; i <= (r + l) / 2; i++, j--)
- {
- int t = a[i];
- a[i] = a[j];
- a[j] = t;
- }
- /*for(i = 0; i < n; i++) printf("%d ", a[i]);
- printf("\n");
- for(i = 0; i < n; i++) printf("%d ", b[i]);*/
- for(i = l; i <= r; i++)
- {
- if(a[i] != b[i])
- {
- printf("no\n");
- return 0;
- }
- }
- printf("yes\n");
- printf("%d %d\n", l+1, r+1);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement