比较经典的动态规划,定义dp[i]为第i关时能获得的最多的钱,用哈希表与前缀和加速状态转移
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
感谢群友March.H的投稿!!
By signing up a CodeFun2000 universal account, you can submit code and join discussions in all online judging services provided by us.