Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"HackerRank-wet-shark-and-kth-largest-number\":[\"Kth Number\",317,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/morgan-stanley-2015\\u0027 target\\u003d\\u0027_blank\\u0027\\u003emorgan-stanley-2015\\u003c/a\\u003e\"],\"Gym-101161E\":[\"ACM Tax\",317,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101161\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016-2017 ACM-ICPC Asia-Bangkok Regional Contest\\u003c/a\\u003e\"],\"CodeForces-226E\":[\"Noble Knight\\u0027s Path\",464,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/226\\\"\\u003eCodeforces Round 140 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-MKTHNUM\":[\"K-th Number\",6026,\"Northeastern Europe 2004 Northern Subregion\"],\"LightOJ-1188\":[\"Fast Queries\",1761,null],\"CodeChef-DISTNUM2\":[\"Easy Queries\",157,\"mgch\"],\"CodeForces-707D\":[\"Persistent Bookcase\",2875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/707\\\"\\u003eCodeforces Round 368 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-813E\":[\"Army Creation\",2667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"CodeForces-837G\":[\"Functions On The Segments\",689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"SPOJ-TTM\":[\"To the moon\",1247,\"Own Problem, 2012 Multi-University Training Contest 5\"],\"CodeForces-833B\":[\"The Bakery\",4791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/833\\\"\\u003eCodeforces Round 426 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-DQUERY\":[\"D-query\",15751,\"Minesweeper\"],\"CodeForces-547E\":[\"Mike and Friends\",2157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/547\\\"\\u003eCodeforces Round 305 (Div. 1)\\u003c/a\\u003e\"],\"CodeChef-CLONEME\":[\"Cloning\",406,\"sidhant007\"],\"CodeForces-786C\":[\"Till I Collapse\",2740,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-COT\":[\"Count on a tree\",3572,\"Just for fun...\"],\"CodeForces-588E\":[\"Duff in the Army\",122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/588\\\"\\u003eCodeforces Round 326 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-960F\":[\"Pathwalks\",2850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/960\\\"\\u003eDivide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-653F\":[\"Paper task\",1028,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/653\\\"\\u003eIndiaHacks 2016 - Online Edition (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-464E\":[\"The Classic Problem\",1470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/464\\\"\\u003eCodeforces Round 265 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-762E\":[\"Radio stations\",1397,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-484E\":[\"Sign on Fence\",2394,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/484\\\"\\u003eCodeforces Round 276 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-PSEGTREE\":[\"Make Versions in Segment Tree\",539,\"\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"2019331063","updateTime":1697113968000,"title":"Persistent Segment Tree Problem Set","dislikeCnt":0,"content":"I recently learn about persistent segment tree and I searched some problems for that and found some good problems and some vjudge contests. I also found a great DP workbook on vjudge. I wanted a similar workbook for persistent segment tree, but I didn\u0027t find any. So I am making one. \n\n## Problems\n[problem:CodeChef-CLONEME]\n[problem:CodeChef-DISTNUM2]\n[problem:CodeForces-226E]\n[problem:CodeForces-464E]\n[problem:CodeForces-484E]\n[problem:CodeForces-547E]\n[problem:CodeForces-588E]\n[problem:CodeForces-653F]\n[problem:CodeForces-707D]\n[problem:CodeForces-762E]\n[problem:CodeForces-786C]\n[problem:CodeForces-813E]\n[problem:CodeForces-833B]\n[problem:CodeForces-837G]\n[problem:CodeForces-960F]\n[problem:Gym-101161E]\n[problem:HackerRank-wet-shark-and-kth-largest-number]\n[problem:LightOJ-1188]\n[problem:SPOJ-COT]\n[problem:SPOJ-DQUERY]\n[problem:SPOJ-MKTHNUM]\n[problem:SPOJ-PSEGTREE]\n[problem:SPOJ-TTM]\n","threadId":151034,"likeCnt":3,"createTime":1688219229000,"isWorkbook":true,"viewCnt":189,"openness":2,"fav":false,"id":3766,"trustable":false}