タグ: 貪欲法

知識解説

• 貪欲法
  今後記述予定。

問題解説

ABCのA問題から順、ARCのA問題から順、AGCのA問題から順、その他の順で表示します。

• ABC461 C - Variety
• ABC471 C - Cookies and Greedy Takahashi
• ABC463 D - Maximize the Gap
• ABC476 D - Automat
• ABC462 E - Alternating Costs
• ABC467 E - Adjacent Sums (hard)
• ABC473 E - K-Divisible Subarrays
• ABC474 E - One Time Coupon
• ABC467 F - Email Scheduling Optimization
• ABC468 F - Chmax
• ABC471 F - Concat (maximize)
• ARC223 A - Unusual-Constraint Knapsack
• ARC229 A - AtCoder Reverse Contest
• ARC224 B - Adjacent Tiles
• ARC226 B - Bin-ary Packing
• ARC227 B - Know Your Place
• ARC228 B - Minimize Topological Order
• ARC224 C - Ascending Labels
• ARC229 C - Sum of Average 2
• ARC230 C - Buildings
• ARC224 D - Angst for All Pairs
• ARC224 E - ABC|AB|A
• ARC229 F - Angst for All Pairs 2
• TDPC G - 辞書順
• TDPC I - イウィ
• EDPC X - Tower