题意
传送门 POJ 3017
题解
设 a i {a_i} ai 的前缀和为 s u m i sum_{i} sumi ,则有递推式
d p [ i ] = m i n s u m [ i ] − s u m [ j ] ≤ M { d p [ j ] + m a x j + 1 ≤ k ≤ i { a k } } dp[i]=min_{sum[i]-sum[j]\leq M}\{dp[j]+max_{j+1\leq k\leq i}\{a_k\}\} dp[i]=minsum[i]−sum[j]≤M{dp[j]+maxj+1≤k≤i{ak}}
暴力求解 O ( N 2 ) O(N^2) O(N2),需要优化。易推, d p [ i ] dp[i] dp[i] 单调不减;设满足 s u m [ i ] − s u m [ j ] < M sum[i]-sum[j]<M sum[i]−sum[j]<M 的区间 [ j + 1 , i ] [j+1,i] [j+1,i] 元素最大值下标为 i d x idx idx,则对于区间 [ j + 1 , i d x ) [j+1,idx) [j+1,idx),最小的 ( d p [ j ] + m a x j + 1 ≤ k < i d x { a k } ) (dp[j]+max_{j+1\leq k< idx}\{a_k\}) (dp[j]+maxj+1≤k<idx{ak}) 为 ( d p [ j + 1 ] + a k ) (dp[j+1]+a_k) (dp[j+1]+ak);对于 [ i d x , i ] [idx,i] [idx,i] 区间的处理同理。
设满足 s u m [ i ] − s u m [ l b ] ≤ M sum[i]-sum[lb]\leq M sum[i]−sum[lb]≤M 的最小下标为 l b lb lb,对于元素 a i a_i ai,用满足 s u m [ h e a d ] − s u m [ t a i l − 1 ] ≤ M sum[head]-sum[tail-1]\leq M sum[head]−sum[tail−1]≤M 的单调递减队列维护 [ l b , i ] [lb,i] [lb,i] 内各个子区间的最大值;遍历单调队列更新 d p [ i ] dp[i] dp[i] 即可。
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
typedef long long ll;
#define maxn 100005
ll n, m, sum[maxn], dp[maxn];
int a[maxn], idx[maxn];
int main()
{
scanf("%lld%lld", &n, &m);
bool f = 0;
for (int i = 1; i <= n; i++)
{
scanf("%d", a + i);
f |= (a[i] > m);
sum[i] = sum[i - 1] + a[i];
}
if (f)
{
printf("%d\n", -1);
return 0;
}
int l = 0, r = -1, lb = 1;
for (int i = 1; i <= n; i++)
{
while (l <= r && sum[i] - sum[idx[l] - 1] > m) ++l;
while (sum[i] - sum[lb-1] > m) ++lb;
while (l <= r && a[idx[r]] <= a[i]) --r;
idx[++r] = i, dp[i] = dp[lb - 1] + a[idx[l]];
for (int j = l + 1; j <= r; j++)
{
dp[i] = min(dp[i], dp[idx[j - 1]] + a[idx[j]]);
}
}
printf("%lld\n", dp[n]);
return 0;
}