「codeforces - 1621G」Weighted Increasing Subsequences
link。一个 dp(拜谢 ly)和切入点都略有不同的做法,并不需要观察啥性质。原问题针对子序列进行规划,自然地想到转而对前缀进行规划。接下来我们考虑一个前缀 以及一个 $j ...
In mathematics you don't understand things, you just get used to them.
In mathematics you don't understand things, you just get used to them.