六老板的博客

Sample Input BDHPY CM GQ K * AC B $ Sample Output KGCBDHQMPY BAC #include <map> #include <queue> #include <cmath> #include <cstdio> #include <cstring> #incl...

这里写代码片

#include <bits/stdc++.h> typedef struct node { int data; struct node *l,*r,*par; }*tree; int length(tree root) { int cou=0,len1,len2; if(root) { len1=length(root->...

#include <bits/stdc++.h> typedef struct node { int data; struct node *l,*r; }*tree; int length(tree root) { int cou=0,len1,len2; if(root) { len1=length(root->l); ...

include

#include<stdio.h> #include<string.h> #include<stdlib.h> #include<algorithm> #include<malloc.h> using namespace std; char tree[500];////字符串 int nu

include

include

include