Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"AtCoder-abc292_e\":[\"Transitivity\",1638,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc292\\\"\\u003eAtCoder Beginner Contest 292\\u003c/a\\u003e\"],\"AtCoder-abc317_d\":[\"President\",3124,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc317\\\"\\u003eGAMEFREAK Programming Contest 2023 (AtCoder Beginner Contest 317)\\u003c/a\\u003e\"],\"AtCoder-abc337_e\":[\"Bad Juice\",2399,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc337\\\"\\u003eToyota Programming Contest 2024#1(AtCoder Beginner Contest 337)\\u003c/a\\u003e\"],\"AtCoder-abc336_e\":[\"Digit Sum Divisible\",1021,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc336\\\"\\u003eAtCoder Beginner Contest 336\\u003c/a\\u003e\"],\"AtCoder-abc335_e\":[\"Non-Decreasing Colorful Path\",1088,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc335\\\"\\u003eAtCoder Beginner Contest 335 (Sponsored by Mynavi)\\u003c/a\\u003e\"],\"AtCoder-abc322_e\":[\"Product Development\",2182,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc322\\\"\\u003eAtCoder Beginner Contest 322\\u003c/a\\u003e\"],\"AtCoder-abc343_g\":[\"Compress Strings\",308,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc343\\\"\\u003eAtCoder Beginner Contest 343\\u003c/a\\u003e\"],\"AtCoder-abc322_f\":[\"Vacation Query\",693,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc322\\\"\\u003eAtCoder Beginner Contest 322\\u003c/a\\u003e\"],\"AtCoder-abc342_g\":[\"Retroactive Range Chmax\",395,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc342\\\"\\u003eHUAWEI Programming Contest 2024(AtCoder Beginner Contest 342)\\u003c/a\\u003e\"],\"AtCoder-abc343_f\":[\"Second Largest Query\",1651,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc343\\\"\\u003eAtCoder Beginner Contest 343\\u003c/a\\u003e\"],\"AtCoder-abc344_e\":[\"Insert or Erase\",3327,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc344\\\"\\u003e\\tToyota Programming Contest 2024#3(AtCoder Beginner Contest 344)\\u003c/a\\u003e\"],\"AtCoder-abc344_d\":[\"String Bags\",3861,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc344\\\"\\u003e\\tToyota Programming Contest 2024#3(AtCoder Beginner Contest 344)\\u003c/a\\u003e\"],\"AtCoder-abc341_f\":[\"Breakdown\",1043,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc341\\\"\\u003eToyota Programming Contest 2024#2(AtCoder Beginner Contest 341)\\u003c/a\\u003e\"],\"AtCoder-abc342_e\":[\"Last Train\",1406,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc342\\\"\\u003eHUAWEI Programming Contest 2024(AtCoder Beginner Contest 342)\\u003c/a\\u003e\"],\"AtCoder-abc317_f\":[\"Nim\",415,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc317\\\"\\u003eGAMEFREAK Programming Contest 2023 (AtCoder Beginner Contest 317)\\u003c/a\\u003e\"],\"AtCoder-abc340_f\":[\"S \\u003d 1\",1160,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc340\\\"\\u003eKAJIMA CORPORATION CONTEST 2024(AtCoder Beginner Contest 340)\\u003c/a\\u003e\"],\"AtCoder-abc341_e\":[\"Alternating String\",2087,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc341\\\"\\u003eToyota Programming Contest 2024#2(AtCoder Beginner Contest 341)\\u003c/a\\u003e\"],\"AtCoder-abc340_e\":[\"Mancala 2\",2140,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc340\\\"\\u003eKAJIMA CORPORATION CONTEST 2024(AtCoder Beginner Contest 340)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"gsl32","updateTime":1710292668000,"title":"gsl","dislikeCnt":0,"content":"### line DP\n1. [problem:AtCoder-abc344_d]\n\n### 双向链表\n1. [problem:AtCoder-abc344_e]\n\n### binary trick\n1. [problem:AtCoder-abc337_e]\n\n### KMP or Z\n1. [problem:AtCoder-abc343_g] kmp预处理然后状态压缩dp\n### DSU\n1. [problem:AtCoder-abc335_e]\n### BFS\n1. [problem:AtCoder-abc292_e]\n### Dijkstra\n1. [problem:AtCoder-abc342_e]\n\n### digit DP\n1. [problem:AtCoder-abc317_f]\n2. [problem:AtCoder-abc336_e]\n### 背包DP\n1. [problem:AtCoder-abc317_d]\n2. [problem:AtCoder-abc322_e] 一般是十进制, 这题需要转换成P进制背包 \n3. [problem:AtCoder-abc341_f]\n### SegMentTree\n1. [problem:AtCoder-abc343_f]\n### LazySegmentTree\n1. [problem:AtCoder-abc341_e] 试试不用线段树\n2. [problem:AtCoder-abc340_e]\n3. [problem:AtCoder-abc322_f]\n4. [problem:AtCoder-abc342_g] 对线段树的理解 \n### exgcd\n1. [problem:AtCoder-abc340_f]","threadId":180737,"likeCnt":0,"createTime":1706183634000,"isWorkbook":true,"viewCnt":71,"openness":2,"fav":false,"id":4500,"trustable":false}