Little Elephant and Problem CodeForces - 220A

 

 题意：给定一个数组，看能不能交换一次之后让数组排序成功

题解：直接建一个b数组sort后，看和a不同位置的个数有没有大于2。

#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<cstring>
#include<vector>
#include<set>
#include<cmath>
#include<cstring>
#include<cstdlib>
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define PII pair<int,int>
#define ll long long
#define ull unsigned long long
#define PLL pair<long long,long long>
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scl(a) scanf("%lld",&a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define ac cout<<ans<<endl
using namespace std;
int a[100010],b[100010];
void solve()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        scd(a[i]);
        b[i]=a[i];
    }
    sort(a+1,a+1+n);
    ll ans=0;
    rep1(i,n) if(a[i]!=b[i]) ans++;
    if(ans>2) cout<<"NO";
    else cout<<"YES";
    return;

}
signed main()
{
    int t=1;
    //scd(t);
    while(t--) solve();
    return 0;
}