摘要：Merge sortView Code #include <iostream>#include <cstdio>#include <vector>#include <cstring>#include <algorithm>int f_min(int x,int y) {if(x<y)return x; else return y;}int f_max(int x,int y) {if(x<y)return y; else return x;}//double f_min(double x,double y) {if(x&l 阅读全文

摘要：插入排序View Code #include <iostream>#include <cstdio>#include <queue>#include <set>#include <map>#include <cstring>#include <algorithm>using namespace std;const int mod = 1000000007;const int MM = 111111;int N;int num[MM];void get_data() { int i,j,k; for(i=1;i& 阅读全文