PAT (Advanced Level) 1089. Insert or Merge (25)

简单题。模拟一下即可。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;

const int maxn=;
int a[maxn],b[maxn],n;

int main()
{
    scanf("%d",&n);
    for(int i=; i<=n; i++) scanf("%d",&a[i]);
    for(int i=; i<=n; i++) scanf("%d",&b[i]);

    int flag=;

    int p=n+;
    for(int i=;i<=n;i++)
        if(b[i]<b[i-]) {p=i; break;}

    for(int i=p;i<=n;i++)
    {
        if(a[i]==b[i]) continue;
        else flag=;
    }

    if(flag==)
    {
        printf("Insertion Sort\n");
        if(p==n+) p=n;
        sort(a+,a+p+);
        for(int i=; i<=p; i++)
        {
            printf("%d",a[i]);
            if(i<n) printf(" ");
            else printf("\n");
        }
        for(int i=p+; i<=n; i++)
        {
            printf("%d",a[i]);
            if(i<n) printf(" ");
            else printf("\n");
        }
    }
    else
    {
        printf("Merge Sort\n");

        int len=;
        while()
        {
            int pp=;
            while()
            {
                if(pp+len->n)
                {
                    sort(a+pp,a+n+);
                    break;
                }
                else
                {
                    sort(a+pp,a+pp+len);
                    pp=pp+len;
                }
            }

            int fail=;
            for(int i=; i<=n; i++) if(a[i]!=b[i]) fail=;

            if(fail==)
            {
                len=len*;
                int ppp=;
                while()
                {
                    if(ppp+len->n)
                    {
                        sort(a+ppp,a+n+);
                        break;
                    }
                    else
                    {
                        sort(a+ppp,a+ppp+len);
                        ppp=ppp+len;
                    }
                }
                for(int i=;i<=n;i++)
                {
                    printf("%d",a[i]);
                    if(i<n) printf(" ");
                    else printf("\n");
                }
                break;
            }
            len=len*;
        }
    }

    return ;
}