题目大意
解题思路
不用多说直接暴力。
code
#include<set>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define LF double
#define LL long long
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a>b)?b:a)
#define fo(i,j,k) for(int i=j;i<=k;i++)
#define fd(i,j,k) for(int i=j;i>=k;i--)
using namespace std;
int const maxn=100000,inf=2147483647;
int n,a[maxn+10],b[maxn+10];
int main(){
freopen("d.in","r",stdin);
freopen("d.out","w",stdout);
scanf("%d",&n);
fo(i,1,n)scanf("%d",&a[i]),b[i]=a[i];
sort(b+1,b+n+1);
int cnt=0;fo(i,1,n)cnt+=(a[i]!=b[i]);
if((cnt==0)||(cnt==2))printf("YES");
else printf("NO");
return 0;
}