HDU_3600_八数码之类的问题是否有解

/*
八数码的真谛
逆序数：前面比当前位小的个数zuih
据说线段数可以用来求逆序数
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<map>
const int maxn = 1000000;
using namespace std;
int n;
int tree[maxn<<2];
void work(int rt)
{
    tree[rt] = tree[rt<<1]+tree[rt<<1|1];
}
void updata(int val,int l, int r, int rt)
{
    if(l == r)
    {
        tree[rt] = 1;
        return;
    }
    int mid = (l+r)>>1;
    if(val <= mid)
        updata(val, l,mid,rt<<1);
    else
        updata(val, mid+1,r,rt<<1|1);
    work(rt);
}
int query(int x, int y, int l, int r, int rt)
{
    if(x<=l&&r<=y)
        return tree[rt];
    int mid = (l+r)>>1;
    int ans = 0;
    if(x<=mid)
        ans += query(x,y,l,mid,rt<<1);
    if(mid<y)
        ans+=query(x,y,mid+1,r,rt<<1|1);
    return ans;
}
int main()
{
    int a,ans,ert;
    int x,y;
    while(scanf("%d",&n)!=EOF&&n)
    {
        int m = n;
        n=n*n;
        ert = ((n-2)*(1+n-2))/2;
        ans = 0;
        memset(tree, 0, sizeof(tree));
        for(int i = 1; i <= m; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                scanf("%d",&a);
                if(a==0)
                {
                    x = i;
                    y = j;
                }
                ans += query(1,n-a,1,n,1);
                updata(n-a,1,n,1);
            }
        }
        ans -= ((x-1)*m+y-1);
        if(!(m&1))
            ans += (m-x);
        if(ans&1)
            puts("NO");
        else
            puts("YES");
    }
    return 0;
}
/*
3
8 7 1
5 2 6
3 4 0
*/