greedy algorithm

Easy Problems

Simple Count Description For two \(1\)~\(n\), define \(a,b\), orz(a,b)=max(a_1, b_1)+\)... (+max(a_n, b_n)\). You need t...
13:44 24 November 2021

Noip simulation 90 2021.11.5 (longest problem solution)

T1 palindrome This classic \ (dp \) just can'...
22:34 5 November 2021