Zenith_Habitant的博客

#include<stdio.h>#include<algorithm>#include<iostream>using namespace std;void merge(int arr[] , int L , int M , int R)//归并处理{ int Left_size = M-L;//左数组长度 int Right_si...

//归并排序求正序数？（逆序）！！！#include<stdio.h>#include<string.h>using namespace std;#define maxn 1000005struct node{ int value; int mark;}a[maxn];long long sum;int ans[maxn];void m...

#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>#include<iostream>using namespace std;int n;long long m;int num[25];bool mark[25];void ...