题目
思路
考虑 d p [ i ] dp[i] dp[i] 为砍掉第 i i i 棵树的最小代价,因为 b [ n ] = 0 b[n]=0 b[n]=0,所以目的是求 d p [ n ] dp[n] dp[n]
考虑计算 d p [ k ] dp[k] dp[k]。因为 b i b_i bi 单调递减,所以砍掉编号 > k >k >k 的树之后,就不会再回来管 k k k,而是向 n n n 奋起直追。这一点似乎很多题解里并没有考虑。
所以 d p [ k ] dp[k] dp[k] 只会由 < k <k <k 的 d p dp dp 来转移,所以我们考虑枚举 i i i,此时 d p [ k ] = min ( d p [ i ] + b [ i ] ∗ a [ k ] ) dp[k]=\min(dp[i]+b[i]*a[k]) dp[k]=min(dp[i]+b[i]∗a[k])。于是得到了一个 O ( n 2 ) O(n^2) O(n2) 的朴素 d p \tt dp dp
考虑优化决策时间复杂度。对于前置决策 i , j i,j i,j且 i < j i<j i<j,当前位置 k k k,该从哪里转移过来。对于选择 i i i 的条件为 d p [ i ] + b [ i ] ∗ a [ k ] < d p [ j ] + b [ j ] ∗ a [ k ] dp[i]+b[i]*a[k]<dp[j]+b[j]*a[k] dp[i]+b[i]∗a[k]<dp[j]+b[j]∗a[k]
移项得到: d p [ i ] − d p [ j ] b [ j ] − b [ i ] > a [ k ] \frac{dp[i]-dp[j]}{b[j]-b[i]}>a[k] b[j]−b[i]dp[i]−dp[j]>a[k]
显然的斜率优化,单调队列维护即可。
Code:
LL a[MAXN], b[MAXN], dp[MAXN];
deque<LL> Q;
DB Getk(LL i,LL j)
{
return (dp[i] - dp[j] + 0.0) / (b[j] - b[i]);
}
int main()
{
LL n;
read( n );
for (Int i = 1; i <= n; ++ i)
read( a[i] );
for (Int i = 1; i <= n; ++ i)
read( b[i] );
Q.push_front( 1 );
for (Int i = 2; i <= n; ++ i)
{
while (Q.size() > 1)
{
LL t1 = Q.front();
Q.pop_front();
LL t2 = Q.front();
Q.pop_front();
if (Getk(t1, t2) > a[i])
{
Q.push_front( t2 );
Q.push_front( t1 );
break;
}
else Q.push_front( t2 );
}
LL j = Q.front();
dp[i] = dp[j] + b[j] * a[i];
while (Q.size() > 1)
{
LL t1 = Q.back();
Q.pop_back();
LL t2 = Q.back();
Q.pop_back();
if (Getk(t1, i) > Getk(t2, t1))
{
Q.push_back( t2 );
Q.push_back( t1 );
break;
}
else Q.push_back( t2 );
}
Q.push_back( i );
}
printf("%lld", dp[n]);
return 0;
}