Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P4822\":[\"冻结\",5387,\"BJWC2012\"],\"洛谷-P1438\":[\"无聊的数列\",11197,null],\"洛谷-P1757\":[\"通天之分组背包\",28350,null],\"洛谷-P1637\":[\"三元上升子序列\",9329,null],\"AtCoder-abc015_4\":[\"高橋くんの苦悩\",121,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc015\\\"\\u003eAtCoder Beginner Contest 015\\u003c/a\\u003e\"],\"CodeForces-475D\":[\"CGCDSSQ\",5069,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/475\\\"\\u003eBayan 2015 Contest Warm Up\\u003c/a\\u003e\"],\"洛谷-P3385\":[\"负环\",38645,\"模板\"],\"洛谷-P4155\":[\"国旗计划\",3883,\"SCOI2015\"],\"洛谷-P5960\":[\"差分约束\",18301,\"模板\"],\"洛谷-P4513\":[\"小白逛公园\",11129,null],\"洛谷-P4832\":[\"珈百璃堕落的开始\",361,null],\"洛谷-P3865\":[\"ST 表\",74646,\"模板\"],\"洛谷-P1048\":[\"采药\",189976,\"NOIP2005 普及组\"],\"洛谷-P1966\":[\"火柴排队\",21818,\"NOIP2013 提高组\"],\"洛谷-P3509\":[\"ZAB-Frog\",1778,\"POI2010\"],\"洛谷-P1608\":[\"路径统计\",7093,null],\"CodeForces-507E\":[\"Breaking Good\",2811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/507\\\"\\u003eCodeforces Round 287 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5094\":[\"MooFest G 加强版\",3551,\"USACO04OPEN\"],\"洛谷-P4085\":[\"Haybale Feast G\",2095,\"USACO17DEC\"],\"洛谷-P2184\":[\"贪婪大陆\",6074,null],\"洛谷-P6225\":[\"异或橙子\",2285,\"eJOI2019\"],\"CodeForces-240F\":[\"TorCoder\",1944,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/240\\\"\\u003eCodeforces Round 145 (Div. 1, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"洛谷-P3870\":[\"开关\",13989,\"TJOI2009\"],\"洛谷-P5057\":[\"简单题\",11516,\"CQOI2006\"],\"洛谷-P5651\":[\"基础最短路练习题\",3063,null],\"洛谷-P2787\":[\"语文1(chin1)- 理理思维\",1246,null],\"洛谷-P1972\":[\"HH的项链\",24052,\"SDOI2009\"],\"洛谷-P1776\":[\"宝物筛选\",28805,null],\"洛谷-P1616\":[\"疯狂的采药\",87399,null],\"AtCoder-abc339_e\":[\"Smooth Subsequence\",2558,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc339\\\"\\u003eJapan Registry Services (JPRS) Programming Contest 2024 (AtCoder Beginner Contest 339)\\u003c/a\\u003e\"],\"CodeForces-558E\":[\"A Simple Task\",6145,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/558\\\"\\u003eCodeforces Round 312 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4377\":[\"Talent Show G\",4080,\"USACO18OPEN\"],\"洛谷-P1782\":[\"旅行商的背包\",3072,null],\"洛谷-P9027\":[\"Math Homework\",110,\"CCC2021 S5\"],\"洛谷-P1462\":[\"通往奥格瑞玛的道路\",19499,null],\"洛谷-P3369\":[\"普通平衡树\",112215,\"模板\"],\"洛谷-P3368\":[\"树状数组 2\",60861,\"模板\"],\"CodeForces-1834E\":[\"MEX of LCM\",2108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1834\\\"\\u003eCodeforces Round 879 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1821\":[\"Cow Party S\",8660,\"USACO07FEB\"],\"洛谷-P4779\":[\"单源最短路径(标准版)\",125526,\"模板\"],\"洛谷-B3647\":[\"Floyd\",12364,\"模板\"],\"洛谷-P5905\":[\"全源最短路(Johnson)\",7419,\"模板\"],\"CodeForces-938D\":[\"Buy a Ticket\",5901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/938\\\"\\u003eEducational Codeforces Round 38 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1908\":[\"逆序对\",101434,null],\"CodeForces-577B\":[\"Modulo Sum\",12598,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/577\\\"\\u003eCodeforces Round 319 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3372\":[\"线段树 1\",157579,\"模板\"],\"洛谷-P3373\":[\"线段树 2\",65997,\"模板\"],\"洛谷-P3371\":[\"单源最短路径(弱化版)\",123368,\"模板\"],\"洛谷-P2880\":[\"Balanced Lineup G\",23336,\"USACO07JAN\"],\"洛谷-P3374\":[\"树状数组 1\",95497,\"模板\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"David9006","updateTime":1714530897000,"title":"GoldenApple 的题单","dislikeCnt":0,"content":"### 倍增 \u0026 ST 表\n\n[problem:洛谷-P4155]\n[problem:洛谷-P3509]\n[problem:洛谷-P4085]\n[problem:洛谷-P3865]\n[problem:洛谷-P9027]\n[problem:洛谷-P2880]\n[problem:CodeForces-475D]\n[problem:CodeForces-1834E]\n\n-----\n\n### 树状数组\n\n[problem:洛谷-P3374]\n[problem:洛谷-P3368]\n[problem:洛谷-P3372] 用树状数组做\n[problem:洛谷-P1908]\n[problem:洛谷-P1637]\n[problem:洛谷-P6225]\n[problem:洛谷-P5094]\n[problem:洛谷-P1966]\n[problem:洛谷-P1972]\n\n-----\n\n### 线段树\n\n[problem:洛谷-P3372]\n[problem:洛谷-P3373]\n[problem:洛谷-P5057]\n[problem:洛谷-P1438]\n[problem:洛谷-P2184]\n[problem:洛谷-P3870]\n[problem:洛谷-P2787]\n[problem:CodeForces-558E]\n[problem:AtCoder-abc339_e]\n[problem:洛谷-P4513]\n[problem:洛谷-P3369] 用值域线段树做\n[problem:CodeForces-240F]\n\n-----\n\n### 最短路\n\n[problem:洛谷-B3647]\n[problem:洛谷-P3371]\n[problem:洛谷-P3385]\n[problem:洛谷-P4779]\n[problem:洛谷-P5960]\n[problem:洛谷-P5905]\n[problem:洛谷-P1821]\n[problem:洛谷-P5651]\n[problem:洛谷-P1462]\n[problem:洛谷-P1608]\n[problem:洛谷-P4822]\n[problem:CodeForces-507E]\n[problem:CodeForces-938D]\n\n-----\n\n### 背包 DP\n\n[problem:洛谷-P1048]\n[problem:洛谷-P1616]\n[problem:洛谷-P1757]\n[problem:洛谷-P1776]\n[problem:洛谷-P4832]\n[problem:洛谷-P4377]\n[problem:洛谷-P1782]\n[problem:CodeForces-577B]\n[problem:AtCoder-abc015_4]","threadId":178511,"likeCnt":1,"createTime":1703294961000,"isWorkbook":true,"viewCnt":95,"openness":2,"fav":false,"id":4412,"trustable":false}