NamoCamp 每日一题 namonamo 折半搜索

|–>传送门 ed){ int slen = std::min(a.size(), b.size()); for(int i = 0; i b.size()) smp.insert(a.substr(b.size())); else if(a.size() ed){ std::string aa = a, bb = b; std::reverse(aa.begin(), aa.end()); std::reverse(bb.begin(), bb.end()); int slen = std::min(aa.size(), bb.size()); for(int i = 0; i bb.size()) aft = aa.substr(bb.size()); else if(aa.size() > s; s = '@' + s; int slen = s.size() - 1; std::string a, b; dfs1(1, slen >> 1, a, b); dfs2((slen >> 1) + 1, slen, a, b); if(flag) std::cout