Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"HDU-3949\":[\"XOR\",2493,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Multi-University+Training+Contest+11+-+Host+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 11 - Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3308\":[\"LCIS\",2925,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.02.06+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.02.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1055B\":[\"Alice and Hairdresser\",5038,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1055\\\"\\u003eMail.Ru Cup 2018 Round 2\\u003c/a\\u003e\"],\"CodeForces-1176B\":[\"Merge it!\",17863,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1176\\\"\\u003eCodeforces Round 565 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1176A\":[\"Divide it!\",24545,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1176\\\"\\u003eCodeforces Round 565 (Div. 3)\\u003c/a\\u003e\"],\"HDU-1024\":[\"Max Sum Plus Plus\",13562,\"\"],\"HDU-6438\":[\"Buy and Resell\",1426,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2018%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC+-+%CD%F8%C2%E7%D1%A1%B0%CE%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2018中国大学生程序设计竞赛 - 网络选拔赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2871\":[\"Memory Control\",1055,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+7+-+Host+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 7 - Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1100F\":[\"Ivan and Burgers\",2241,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1100\\\"\\u003eCodeforces Round 532 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1152C\":[\"Neko does Maths\",6915,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1152\\\"\\u003eCodeforces Round 554 (Div. 2)\\u003c/a\\u003e\"],\"HDU-2874\":[\"Connections between cities\",2836,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+8+-+Host+by+BJNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 8 - Host by BJNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1176D\":[\"Recover it!\",5371,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1176\\\"\\u003eCodeforces Round 565 (Div. 3)\\u003c/a\\u003e\"],\"HDU-6579\":[\"Operation\",1064,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2019+Multi-University+Training+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2019 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1055C\":[\"Lucky Days\",1928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1055\\\"\\u003eMail.Ru Cup 2018 Round 2\\u003c/a\\u003e\"],\"CodeForces-1176C\":[\"Lose it!\",14784,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1176\\\"\\u003eCodeforces Round 565 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-825D\":[\"Suitable Replacement\",3419,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-988C\":[\"Equal Sums\",10526,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/988\\\"\\u003eCodeforces Round 486 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-825C\":[\"Multi-judge Solving\",4765,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-1061D\":[\"TV Shows\",2443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1061\\\"\\u003eCodeforces Round 523 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1095E\":[\"Almost Regular Bracket Sequence\",4180,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1095\\\"\\u003eCodeforces Round 529 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-548C\":[\"Mike and Frog\",78,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/548\\\"\\u003eCodeforces Round 305 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-825F\":[\"String Compression\",1488,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-1095C\":[\"Powers Of Two\",16947,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1095\\\"\\u003eCodeforces Round 529 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-825G\":[\"Tree Queries\",1198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-1091C\":[\"New Year and the Sphere Transmission\",10216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1091\\\"\\u003eGood Bye 2018\\u003c/a\\u003e\"],\"UVA-133\":[\"The Dole Queue\",11371,null],\"HYSBZ-3884\":[\"上帝与集合的正确用法\",487,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dBy PoPoQQQ\\\"\\u003eBy PoPoQQQ\\u003cbr\\u003e \\u003c/a\\u003e\\u003c/p\\u003e\"],\"HYSBZ-4236\":[\"JOIOJI\",69,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dJOI 2013~2014 春季training合宿 竞技3 By PoPoQQQ\\\"\\u003eJOI 2013~2014 春季training合宿 竞技3 By PoPoQQQ\\u003c/a\\u003e\\u003c/p\\u003e\"],\"HYSBZ-4034\":[\"树上操作\",416,\"HAOI2015\"],\"HDU-6709\":[\"Fishing Master\",1226,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2019%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%A3%A8CCPC%A3%A9+-+%CD%F8%C2%E7%D1%A1%B0%CE%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2019中国大学生程序设计竞赛(CCPC) - 网络选拔赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2763\":[\"Housewife Wind\",2928,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.02.26\\\"\\u003ePOJ Monthly--2006.02.26\\u003c/a\\u003e,zgl \\u0026amp; twb\\u003c/div\\u003e\"],\"HDU-3397\":[\"Sequence operation\",1459,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.05.01\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.05.01 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1167D\":[\"Bicolored RBS\",7090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1167\\\"\\u003eEducational Codeforces Round 65 (Rated for Div. 2)\\u003c/a\\u003e\"],\"HDU-6621\":[\"K-th Closest Distance\",780,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2019+Multi-University+Training+Contest+4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2019 Multi-University Training Contest 4 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1204E\":[\"Natasha, Sasha and the Prefix Sums\",1734,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1204\\\"\\u003eCodeforces Round 581 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1173C\":[\"Nauuo and Cards\",136,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1173\\\"\\u003eCodeforces Round 564 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1173B\":[\"Nauuo and Chess\",9042,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1173\\\"\\u003eCodeforces Round 564 (Div. 2)\\u003c/a\\u003e\"],\"HDU-5974\":[\"A Simple Math Problem\",2550,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016ACM%2FICPC%D1%C7%D6%DE%C7%F8%B4%F3%C1%AC%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B4%F3%C1%AC%BA%A3%CA%C2%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-825B\":[\"Five-In-a-Row\",4710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"HDU-6623\":[\"Minimal Power of Prime\",822,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2019+Multi-University+Training+Contest+4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2019 Multi-University Training Contest 4 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-906D\":[\"Power Tower\",2337,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/906\\\"\\u003eCodeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-1167E\":[\"Range Deleting\",2689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1167\\\"\\u003eEducational Codeforces Round 65 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-977D\":[\"Divide by three, multiply by two\",19477,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/977\\\"\\u003eCodeforces Round 479 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-771D\":[\"Bear and Company\",1157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/771\\\"\\u003eVK Cup 2017 - Round 1\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"hyacinthLJP","updateTime":1573180563000,"title":"习题小结","dislikeCnt":0,"content":"#### **思维题**\n* [problem:CodeForces-1176D] [here](https://www.cnblogs.com/violet-acmer/p/10995733.html) [构造]\n* [problem:CodeForces-977D] [here](https://www.cnblogs.com/violet-acmer/p/11006251.html) [构造]\n* [problem:CodeForces-1173B] [here](https://www.cnblogs.com/violet-acmer/p/10989957.html) [构造]\n* [problem:CodeForces-1176A] [here](https://www.cnblogs.com/violet-acmer/p/10995733.html) [模拟]\n* [problem:CodeForces-825B] [here](https://www.cnblogs.com/violet-acmer/p/11611524.html) [模拟+代码可以很优雅]\n* [problem:UVA-133] [here](https://www.cnblogs.com/violet-acmer/p/11081905.html) [循环报数处理技巧]\n* [problem:CodeForces-1167E] [here](https://www.cnblogs.com/violet-acmer/p/10908926.html)\n* [problem:CodeForces-1055B] [here](https://www.cnblogs.com/violet-acmer/p/10916367.html)\n* 【[2019计蒜之道初赛第一场A](https://nanti.jisuanke.com/t/39260)】 [here](https://www.cnblogs.com/violet-acmer/p/10924210.html)\n* 【[“浪潮杯”第九届山东省ACM大学生程序设计竞赛E.sequence](https://ac.nowcoder.com/acm/contest/123/E)】 [here](https://www.cnblogs.com/violet-acmer/p/10996561.html) [求逆序对思想(划掉)]\n* 【[Wannafly挑战赛15 C“出队”](https://ac.nowcoder.com/acm/contest/112/C)】 [here](https://www.cnblogs.com/violet-acmer/p/11111440.html) [约瑟夫环类问题]\n* 【[洛谷P4375 Out of Sorts G](https://www.luogu.org/problemnew/show/P4375)】 [here](https://www.cnblogs.com/violet-acmer/p/9833481.html) [思维+BIT求逆序对]\n* [problem:CodeForces-1095E] [here](https://www.cnblogs.com/violet-acmer/p/10910761.html) [Regular Bracket Sequence]\n* [problem:CodeForces-1167D] [here](https://www.cnblogs.com/violet-acmer/p/10911125.html) [Regular Bracket Sequence]\n* [problem:CodeForces-1095C] [here](https://www.cnblogs.com/violet-acmer/p/10194775.html) [二进制思想]\n* 【[2019牛客多校第六场 D.Move](https://ac.nowcoder.com/acm/contest/886/D)】 [here](https://www.cnblogs.com/violet-acmer/p/11296211.html) [不可二分]\n\n#### **贪心**\n* [problem:CodeForces-1173C] [here](https://www.cnblogs.com/violet-acmer/p/10989957.html) [贪心]\n* [problem:CodeForces-1176B] [here](https://www.cnblogs.com/violet-acmer/p/10995733.html) [贪心]\n* [problem:CodeForces-825C] [here](https://www.cnblogs.com/violet-acmer/p/11611524.html) [贪心+题意难懂]\n* 【[2018牛客多校第二场 D.money](https://ac.nowcoder.com/acm/contest/140/D)】 [贪心]\n* 【[2019南昌邀请赛网络预选赛 M. Subsequence](https://nanti.jisuanke.com/t/38232)】 [here](https://www.cnblogs.com/violet-acmer/p/10746691.html) [贪心+卡二分]\n* [problem:CodeForces-1176C] [here](https://www.cnblogs.com/violet-acmer/p/10995733.html) [贪心+卡二分]\n* 【[51nod 1380.夹克老爷的逢三抽一](https://www.51nod.com/Challenge/Problem.html#problemId\u003d1380)】 [here](https://www.cnblogs.com/violet-acmer/p/11724569.html) [贪心+set]\n* [problem:CodeForces-1061D] [here](https://www.cnblogs.com/violet-acmer/p/10050210.html) [贪心+multiset]\n* [problem:HDU-6438] [here](https://www.cnblogs.com/violet-acmer/p/11720467.html) [贪心+优先级队列]\n* [problem:HDU-6709] [here](https://www.cnblogs.com/violet-acmer/p/11430360.html) [贪心+优先级队列]\n* 【[The 10th Shandong Provincial Collegiate Programming Contest H.Tokens on the Segments](https://zoj.pintia.cn/problem-sets/91827364500/problems/91827370515)】 [here](https://www.cnblogs.com/violet-acmer/p/10872557.html) [贪心+优先级队列]\n* 【[2019牛客多校第六场 J.Move](https://ac.nowcoder.com/acm/contest/886/J)】 [here](https://www.cnblogs.com/violet-acmer/p/11296211.html) [贪心+优先级队列]\n#### **二分**\n* 【[2019ICPC沈阳网络赛 F. Honk\u0027s pool](https://nanti.jisuanke.com/t/41406)】 [here](https://www.cnblogs.com/violet-acmer/p/11672709.html) [二分两次]\n* [problem:CodeForces-825D] [here](https://www.cnblogs.com/violet-acmer/p/11611524.html) [二分+题意难懂]\n\n#### **树状数组**\n* 【[2019ICPC南京网络赛 A.The beautiful values of the palace](https://nanti.jisuanke.com/t/41298)】 [here](https://www.cnblogs.com/violet-acmer/p/11443355.html) [树状数组+扫描线]\n#### **线段树**\n推荐资料1 : [电子科技大学 shiqi_614](https://blog.csdn.net/shiqi_614/article/details/8228102)\n推荐资料2 : [杭电胡浩](https://www.cnblogs.com/ya-cpp/p/4165777.html)\n* [problem:HDU-3308] [区间合并]\n* [problem:HDU-3397] [here](https://www.cnblogs.com/violet-acmer/p/11678806.html) [区间合并]\n* [problem:HDU-2871] [here](https://www.cnblogs.com/violet-acmer/p/11691263.html) [区间合并+set.upper_bound]\n\n#### **主席树**\n* [problem:HDU-6621] [here](https://www.cnblogs.com/violet-acmer/p/11705086.html) [二分+主席树]\n#### **单调栈**\n* 【[2019牛客多校第一场 A.Equivalent Prefixes](https://ac.nowcoder.com/acm/contest/881/A)】 [here](https://www.cnblogs.com/violet-acmer/p/11209409.html) [思维+单调栈]\n* 【[2019牛客多校第二场 H.Second Large Rectangle](https://ac.nowcoder.com/acm/contest/882/H)】 [here](https://www.cnblogs.com/violet-acmer/p/11219006.html) [思维+单调栈]\n* 【[2019牛客多校第八场 A.All-one Matrices](https://ac.nowcoder.com/acm/contest/888/A)】 [here](https://www.cnblogs.com/violet-acmer/p/11332669.html) [思维+单调栈]\n* [problem:codeForces-548D] [here](https://www.cnblogs.com/violet-acmer/p/11551168.html) [贪心+单调栈]\n\n#### **线性基**\n* [problem:CodeForces-1100F] [here](https://www.cnblogs.com/violet-acmer/p/11579351.html) [离线或在线方式查询区间[l,r]异或最大值]\n* [problem:HDU-6579] [强制在线方式查询区间[l,r]异或最大值]\n* [problem:HDU-3949] [here](https://www.cnblogs.com/violet-acmer/p/11579351.html) [异或第k小查询]\n* 【[2019牛客多校第一场 H.XOR](https://ac.nowcoder.com/acm/contest/881/H)】 [here](https://www.cnblogs.com/violet-acmer/p/11209409.html) [异或和为0的子集查询]\n* 【[2019牛客多校第四场 B.XOR](https://ac.nowcoder.com/acm/contest/884/B?\u0026headNav\u003dacm)】 [here](https://www.cnblogs.com/violet-acmer/p/11255809.html) [线性基求交+线段树区间查询]\n#### **STL**\n* [problem:CodeForces-988C] [here](https://www.cnblogs.com/violet-acmer/p/11228413.html) [map+pair]\n* [problem:HYSBZ-4236] [here](https://www.cnblogs.com/violet-acmer/p/11227967.html) [前缀和+map+pair]\n* [problem:Gym:100989D] [here](https://www.cnblogs.com/violet-acmer/p/11692624.html) [set.lower_bound]\n#### **图论**\n* [problem:HDU-2874] [here](https://www.cnblogs.com/violet-acmer/p/9691362.html) [LCA+并查集+增加虚点建树技巧]\n* 【[2018青岛网络预选赛 B.Red Black Tree](https://zoj.pintia.cn/problem-sets/91827364500/problems/91827370300)】 [here](https://www.cnblogs.com/violet-acmer/p/9677889.html) [LCA+二分答案]\n* [problem:POJ-2763] [here](https://www.cnblogs.com/violet-acmer/p/11782617.html) [LCA+DFS序+树状数组]\n* [problem:HYSBZ-4034] [here](https://www.cnblogs.com/violet-acmer/p/11783072.html) [DFS序+线段树]\n* [problem:CodeForces-825G] [here](https://www.cnblogs.com/violet-acmer/p/11733860.html) [选根建树技巧]\n#### **数学的味道**\n* [problem:CodeForces-1055C] [here](https://www.cnblogs.com/violet-acmer/p/10878200.html) [拓展欧几里得]\n* [problem:CodeForces-1091C] [here](https://www.cnblogs.com/violet-acmer/p/10201691.html) [规律 or GCD]\n* [problem:CodeForces-1152C] [here](https://www.cnblogs.com/violet-acmer/p/10770704.html) [GCD(a,b) \u003d GCD(a,b-a)]\n* [problem:HDU-5974] [here](https://www.cnblogs.com/violet-acmer/p/11785370.html) [GCD(a,b)\u003dGCD(a+b,ab)\u003d1]\n* [problem:CodeForces-548C] [here](https://www.cnblogs.com/violet-acmer/p/11551168.html) [取模循环节+拓展欧几里得]\n* [problem:HDU-6623] [here](https://www.cnblogs.com/violet-acmer/p/11708166.html) [数学+素数相关]\n* 【[2019ICPC南京站 B.super_log](https://nanti.jisuanke.com/t/41299)】 [here](https://www.cnblogs.com/violet-acmer/p/11443355.html) [欧拉降幂]\n* [problem:HYSBZ-3884] [here](https://www.cnblogs.com/violet-acmer/articles/11451240.html) [欧拉降幂]\n* [problem:CodeForces-906D] [here](https://www.cnblogs.com/violet-acmer/articles/11451240.html) [欧拉降幂]\n\n#### **动态规划**\n* [problem:CodeForces-771D] [here](https://www.cnblogs.com/violet-acmer/p/11561343.html)[在构造序列的结尾插数技巧]\n* 【[2019牛客多校第一场 E.ABBA](https://ac.nowcoder.com/acm/contest/881/E)】 [here](https://www.cnblogs.com/violet-acmer/p/11209409.html) [在构造序列的结尾插数技巧]\n* [problem:CodeForces-1204E] [here](https://www.cnblogs.com/violet-acmer/p/11718617.html) [开头,结尾插数技巧]\n* [problem:CodeForces-825F] [here](https://www.cnblogs.com/violet-acmer/p/11611524.html) [KMP求字符串循环节+贪心+DP]\n* [problem:HDU-1024] [here](https://www.cnblogs.com/violet-acmer/articles/11736934.html) [最大M子段和]","threadId":47959,"likeCnt":5,"createTime":1558534475000,"isWorkbook":true,"viewCnt":1951,"openness":2,"fav":false,"id":1131,"trustable":false}