SCat123

摘要： 题目链接:https://www.luogu.com.cn/problem/P5858 状态: \(dp[i][j]\): 放入第 \(j\) 种原料后锅中共 \(i\) 种原料时的最优值 阶段: \(j\) 决策: \(dp[i][j] = \max_{k<j+s}(dp[k][j-1]+k*a[ 阅读全文

摘要： 题目链接:https://codeforces.com/problemset/problem/1656/B 思路: 对序列 \(a\) : \(\{a_1,a_2,\cdots , a_n\}\) , 可进行如下操作: \(select\ x,\ erase(a_x)\ and\ set\ a_i\ 阅读全文