xuwnehao的博客

Problem - E - Codeforces #include<bits/stdc++.h> #define aa first #define bb second using namespace std; const int N=1000005; typedef long long ll; ll n,m,k,t,x[100005],a,b,c,d,h; ll Max(ll a,ll b) {return a>b?a:b;} ll Min(ll a,ll b) {return a.

map本身是个大范围分散数组，套个vector成为二维数组记录每次树出现的先后下标

找到目标排序元素作为key 迭代器使用 #include<iostream> #include<cstring> #include<algorithm> #include<math.h> #include<map> #include<cstdio> #include<string>//完整头文件 using namespace std; map<int ,int>m; int main () { i

#include<iostream> #include<cstring> #include<algorithm> #include<math.h> #include<map> #include<cstdio> #include<string>//完整头文件 using namespace std; map<string ,double>m; int main () { string a; dou.