Alex在无聊时发明了一款游戏，根据给定序列删除元素获取分数。玩家每步选择序列中的一个数ak，并删除ak+1和ak-1，得到ak分。问题是最大化得分。输入包含序列长度n和序列元素，输出能获得的最大分数。通过动态规划求解，状态转移方程为dp[i] = max(dp[i - 2] + ms[i] * i, dp[i - 1])。"
129741604,10602593,Objective-C中的contentInset属性详解,"['objective-c', 'iOS开发', '界面布局']
C. Boredom
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.
Given a sequence a consisting of
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
