POJ2893 M × N Puzzle

对于该类问题，根据列数判断，若列数为奇数，根据奇数码问题，计算当前逆序对个数与初始逆序对个数奇偶性是否相同，若为偶数，根据偶数码问题，计算当前逆序对个数加上两状态空格的行数之差的奇偶性与初始状态是否相同

求逆序对用归并排序

#include<cstdio>
using namespace std;
const int maxn = 1e6 + 5;
int a[maxn], b[maxn], cnt;
void Merge(int l,int mid,int r)
{
    int j = l, k = mid+1;
    for(int i = l; i <= r; i++){
        if(k > r || j <= mid && a[j] < a[k]) b[i] = a[j++];
        else b[i] = a[k++], cnt += mid-j+1;
    }
    for(int i = l; i <= r; i++) a[i] = b[i];
}
void mergesort(int x,int y)
{
    if(x < y){
        int mid = (x+y)/2;
        mergesort(x,mid);
        mergesort(mid+1,y);
        Merge(x,mid,y);
    }
}
int main()
{
    int n, m, x, p, tp;
    while(scanf("%d%d",&n,&m) != EOF && n){
        cnt = 0; p = 0; tp = 0;
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= m; j++){
                scanf("%d",&x);
                if(x) a[++p] = x;
                else tp = n - i;
            }
        }
        mergesort(1,p);
        if(m & 1) tp = 0;
        if((cnt+tp)%2 == 0) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}