qq_37264262的博客

#include<bits/stdc++.h> #define LL long long #define GG long long #define For(i, j, k) for(int i=j; i<=k; i++) #define Dow(i, j, k) for(int i=j; i>=k; i--) using namespace std; inline GG read() { GG x = 0, f = 1; char ch = getchar();.

#include <stdio.h> const int tt=500100; int n,m,a[500100],b[500100]; long long ans; void mergesort(int x,int y) { int k1,k2,k3,i,j,m; if(x==y) return; m=(x+y)/2; //b[] mergesort(x,m); mergesort(m+1,y); k1=x; k2=m+1; k3=x; while(.