摘要:
http://codeforces.com/problemset/problem/816/E Solution: 完了,原来我原来写的都是假的sz优化树D 好啊,如下为真真的板子: cpp include include include include include using namespace 阅读全文
摘要:
"President's Path" Solution: 使用floyed,以及dij的性质. cpp include include include include include using namespace std; const int MAXN=500; const int MAXM=2 阅读全文
摘要:
"CF 292 D" Solution: 并不是不会合并并查集. 而是数组开小了哦. 然后并不是RE了哟. WAWAWAWA cpp include include include include include include using namespace std; const int MAXN 阅读全文
该文被密码保护。 阅读全文