Codeforce~ [CodeForces - 1084D] The Fair Nut and the Best Path(트리 dp) The Fair Nut is going to travel to the Tree Country, in which there are nn cities. Nut wants to rent a car in the city uu and go by a simple path to city vv. Because of strange law, Nut can buy only wiwi liters of gasoli... 동적 계획 (dp)Codeforce~ *[CodeForces - 768B] Code For 1(분치 전략, 아날로그 이분 사상, 아날로그 라인 트리 사상) Initially Sam has a list with a single element n. In each operation Sam must remove any element x, such that x > 1, from the list and insert at the same position , , sequentially. He must continue with these operations ... 분치하다사유Codeforce~ [CodeForces - 124D] Squares(회전 좌표계, 계산 기하학, 사유) You should get from a square (x1; y1) to a square (x2; y2). Using the shortest path is not necessary. A square (x; y) is considered bad, if at least one of the two conditions is fulfilled: |x + y| ≡ 0 (mod 2a), |x - y| ≡... 계산 기하학Codeforce~사유 [CodeForces - 510D] Fox And Jumping(dp,stlmap,수론적 성질) After applying i-th card she becomes able to make jumps of length li, i. The second line contains n numbers li (1 ≤ li ≤ 109), the jump lengths of cards. The third line contains n numbers ci (1 ≤ ci ≤ 105), the costs of ... 동적 계획 (dp)Codeforce~ [CodeForces - 527C] Glass Carving(세그먼트 트리 또는 SBT 또는 set) This process results in making smaller rectangular fragments of glass. Leonid does not move the newly made glass fragments. In particular, a cut divides each fragment of glass that it goes through into smaller fragments.... Codeforce~STL세그먼트 트리
[CodeForces - 1084D] The Fair Nut and the Best Path(트리 dp) The Fair Nut is going to travel to the Tree Country, in which there are nn cities. Nut wants to rent a car in the city uu and go by a simple path to city vv. Because of strange law, Nut can buy only wiwi liters of gasoli... 동적 계획 (dp)Codeforce~ *[CodeForces - 768B] Code For 1(분치 전략, 아날로그 이분 사상, 아날로그 라인 트리 사상) Initially Sam has a list with a single element n. In each operation Sam must remove any element x, such that x > 1, from the list and insert at the same position , , sequentially. He must continue with these operations ... 분치하다사유Codeforce~ [CodeForces - 124D] Squares(회전 좌표계, 계산 기하학, 사유) You should get from a square (x1; y1) to a square (x2; y2). Using the shortest path is not necessary. A square (x; y) is considered bad, if at least one of the two conditions is fulfilled: |x + y| ≡ 0 (mod 2a), |x - y| ≡... 계산 기하학Codeforce~사유 [CodeForces - 510D] Fox And Jumping(dp,stlmap,수론적 성질) After applying i-th card she becomes able to make jumps of length li, i. The second line contains n numbers li (1 ≤ li ≤ 109), the jump lengths of cards. The third line contains n numbers ci (1 ≤ ci ≤ 105), the costs of ... 동적 계획 (dp)Codeforce~ [CodeForces - 527C] Glass Carving(세그먼트 트리 또는 SBT 또는 set) This process results in making smaller rectangular fragments of glass. Leonid does not move the newly made glass fragments. In particular, a cut divides each fragment of glass that it goes through into smaller fragments.... Codeforce~STL세그먼트 트리