Codefroces1077F2. Pictures with Kittens (hard version)

---

做法：裸的單調隊列優化dp

#include <bits/stdc++.h> #define P pair<ll,ll> #define fr first #define sc second typedef long long ll; using namespace std; int n, m, x; ll dp[5002][5002], ans = -1, a[5002]; deque< P > q[5002]; int main() {scanf("%d%d%d",&n,&m,&x);for(int i = 1; i <= n; ++i) scanf("%lld",&a[i]);memset(dp,-1,sizeof(dp));dp[0][0] = 0;q[0].push_back(P(0,0));for(int i = 1; i <= n; ++i) {for(int j = 0; j <= i && j <= x; ++j) {while(!q[j].empty() && q[j].front().sc < i-m) q[j].pop_front();}for(int j = 1; j <= i && j <= x; ++j) {if(!q[j-1].empty() && q[j-1].front().fr != -1) dp[i][j] = q[j-1].front().fr + a[i];}for(int j = 0; j <= i && j <= x; ++j) {while(!q[j].empty() && dp[i][j]>=q[j].back().fr) q[j].pop_back();if(dp[i][j] != -1) q[j].push_back(P(dp[i][j],i));}if(n-i < m) ans = max(ans, dp[i][x]);}printf("%lld\n",ans); }

轉載于:https://www.cnblogs.com/RRRR-wys/p/9972708.html

總結

以上是生活随笔為你收集整理的Codefroces1077F2. Pictures with Kittens (hard version)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。