[HDU 5945] Fxx ans Game

经典的单调队列优化DP题。。

设dp[ i ]表示从 i 消到 1 需要的步数

边界：dp[ 1 ] = 0

那么就有:
if(i % k == 0) dp[i / k] = dp[ i ] + 1;
else dp[i] = min { dp[i-j]+1 | 1<=j<=n }

第一种情况直接特判，第二种情况使用单调队列优化求区间最小值

code:

#include <bits/stdc++.h>
#define int long long

using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
int n, k, t;
int dp[N], q[N]; // 单调队列优化 DP

inline int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (!isdigit(ch))
        f = (ch == '-') ? -1 : 1, ch = getchar();
    while (isdigit(ch))
        x = x * 10 + (ch - '0'), ch = getchar();
    return x * f;
}

main()
{
    // freopen("in.txt", "r", stdin);
    int cas;
    cas = read();
    while (cas--)
    {
        n = read(), k = read(), t = read();
        if (t == 0)
        {
            int cnt = 0;
            while (n != 1)
                n /= k, cnt++;
            cout << cnt << '\n';
            continue;
        }
        if (k == 0)
        {
            int cnt;
            if ((n - 1) % t == 0)
                cnt = (n - 1) / t;
            else
                cnt = (n - 1) / t + 1;
            cout << cnt << '\n';
        }
        int l = 1, r = 1;
        dp[1] = 0;
        q[1] = 1;
        // dp[i] = min(min(dp[i-t]~dp[i-1])+1, dp[i/k]+1)
        for (int i = 2; i <= n; i++) /* 单调队列维护区间最小值 */
        {
            while (l <= r && q[l] < i - t) /* 保证队首在范围内 */
                l++;
            if (l <= r)
                dp[i] = dp[q[l]] + 1; /* 单调队列优化DP */
            if (i % k == 0)
                dp[i] = min(dp[i], dp[i / k] + 1);
            while (l <= r && dp[q[r]] >= dp[i])
                r--;/* 较大值出队 */
            q[++r] = i;
        }
        std::cout << dp[n] << '\n';
    }
    return 0;
}

转载于:https://www.cnblogs.com/wyctstf/p/11375797.html