1200

Codeforces 🟠 CF2053B. Outstanding Impressionist
Codeforces 🟠 CF2053B. Outstanding Impressionist
發表於|CodeforcesDiv. 1 + Div. 2Problemset1200🟠 (普及−)
利用前綴和快速查詢區間內是否存在未被佔用的數值，判斷每個印象的唯一性。
avatar
SayA
你說的對，但是我孤單刷題。
文章
421
標籤
340
分類
86
Subscribe
公告
🌐主站：gdst.dev (hosted by )
🪐鏡像：saya.ing (hosted by )
平凡人的刷題日常。
最新文章
LeetCode 🔴 3806. Maximum Bitwise AND After Increment Operations
LeetCode 🔴 3806. Maximum Bitwise AND After Increment Operations
AtCoder 🌈 AWC0096E Mountain Range Vista
AtCoder 🌈 AWC0096E Mountain Range Vista
AtCoder 🌈 AWC0096D Hiking and Rest
AtCoder 🌈 AWC0096D Hiking and Rest
AtCoder 🌈 AWC0096C Watering the Flower Bed
AtCoder 🌈 AWC0096C Watering the Flower Bed
AtCoder 🌈 AWC0096B Adventurer's Staircase
AtCoder 🌈 AWC0096B Adventurer's Staircase
AtCoder 🌈 AWC0096A Closing Time of the Reception Window
AtCoder 🌈 AWC0096A Closing Time of the Reception Window
分類
標籤
AlgoPythonCodeforcesAtCoderAtCoder Beginner ContestABC模擬(Simulation)狀態壓縮計數(Counter)前綴和(Prefix Sum)貢獻法縮點有序容器(Sorted Container)C++計數(Counting)分組循環迭代(Iteration)遞迴(Recursion)字串(String)併查集(Disjoint Set Union)博弈論(Game Theory)動態規劃(Dynamic Programming)記憶化搜尋(Memoization)狀壓DP模運算(Modular Arithmetic)雜湊表(Hash Table)回溯(Backtracking)DFSBFS樹狀陣列(Binary Indexed Tree)
歸檔
網站資訊
文章數量 :
421
總字數 :
618k
最後更新時間 :