首页 > TAG信息列表 > 3082
3082-二叉树确定
#include <bits/stdc++.h> std::string a, b; std::map<char, int>mp; void solve(int pl, int pr, int il) { if (pl > pr) return; int ipos = mp[a[pl]]; int len = ipos - il; solve(pl + 1, pl + len, il); solve(pl + len +3082-二叉树确定
#include <bits/stdc++.h> std::string a, b; std::map<char, int>mp; void solve(int pl, int pr, int il) { if (pl > pr) return; int ipos = mp[a[pl]]; int len = ipos - il; solve(pl + 1, pl + len, il); solve(pl + len +