摘要:
根据姥姥提示,入栈顺序就是先序遍历,出栈顺序就是中序遍历。然后在用solve函数进行递归分治来求出后序遍历的结果。#include #include #include #include #include #include #include #include #include#incl... 阅读全文
posted @ 2015-05-08 21:56
xryz
阅读(117)
评论(0)
推荐(0)
摘要:
A Find the Spy/* ***********************************************Author :xryzEmail :523689985@qq.comCreated Time :2015/4/12 13:... 阅读全文
posted @ 2015-05-08 21:13
xryz
阅读(135)
评论(0)
推荐(0)
摘要:
#include#include#include#include#include#includeusing namespace std;const int N=100000+5;int bin[N],ans[N];mapm;int Find(int x){ while(bin[... 阅读全文
posted @ 2015-05-08 11:04
xryz
阅读(102)
评论(0)
推荐(0)