#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
const int N = 1e5 + 5;
int sn[N] = { 0 },s[N];
int main()
{
long long n; int sum =0,t,l,r,q=0;
cin >> t;
for (int i = 1; i <= t; ++i)
{
cin>>sn[i];
s[i] = sn[i];
if (sn[i] < sn[i - 1])
{
sum = i;
}
if (sn[i] < sn[i - 1] && q == 0)
{
q = i-1;
}
}
for (int i = q,j=sum; ;--j, ++i)
{
if (i >= j)
{
break;
}
s[j] = sn[i];
s[i] = sn[j];
}
for (int i = 2; i <= t; ++i)
{
if (s[i] < s[i - 1])
{
cout << "0 0";
return 0;
}
}
cout<<q<<" " << sum;
return 0;
}
7.15acwing第二题
最新推荐文章于 2024-07-15 22:10:26 发布