1089. Insert or Merge (25)-白红宇

1089. Insert or Merge (25)

阅读量：4071 次

发布时间：2019-05-25

本文共 1003 字，大约阅读时间需要 3 分钟。

传送门:

AC 代码

#include 
   
    #include 
    
     #include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          using namespace std;int main(){ int n; scanf("%d",&n); vector
           
            initSequence(n),targetSequence(n); for (int i=0; i

nextSequence = initSequence; while (true) { value = value *2; if(value>n) value = n; for (int i=0; i

n) end = n; sort(nextSequence.begin()+i, nextSequence.begin()+end); i = end; } if(nextSequence==targetSequence){ IsMerge = true; value = value *2; if(value>n) value = n; for (int i=0; i

n) end = n; sort(nextSequence.begin()+i, nextSequence.begin()+end); i = end; } break; } if(value>=n) break; } if(IsMerge){ printf("Merge Sort\n"); }else{ printf("Insertion Sort\n"); int pos = n-1; for (int i=n-1;i>=0;--i) { if(targetSequence[i]==initSequence[i]) pos--; else break; } nextSequence = targetSequence; for (int i=pos+1; i<=n; ++i) { sort(nextSequence.begin(), nextSequence.begin()+i); if(nextSequence!=targetSequence) break; } } for (int i=0; i

转载地址：http://hqhji.baihongyu.com/

你可能感兴趣的文章