#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long arr[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  int start = 0, ends = n - 1;
  while (start != ends) {
    if (arr[ends] < arr[start]) {
      reverse(arr + start, arr + ends + 1);
      break;
    } else if (ends == n && arr[ends] > arr[ends - 1]) {
      ends--;
      start++;
    } else if (arr[ends] < arr[ends + 1] && arr[ends] < arr[ends - 1]) {
      if (arr[ends] > arr[start]) {
        start++;
        ends++;
      }
    } else if (arr[ends] > arr[ends + 1] && arr[ends] < arr[ends - 1]) {
      ends++;
      start++;
    }
    ends--;
  }
  for (int i = 1; i < n; i++) {
    if (arr[i] < arr[i - 1]) {
      cout << "no";
      return 0;
    }
  }
  cout << "yes" << endl
       << min(ends + 1, start + 1) << " " << max(ends + 1, start + 1);
  return 0;
}
