【codeforces】730F. Ber Patio【dp】

题目链接：【codeforces】730F. Ber Patio

$dp[i][j]$表示买了前$i$件物品，另外得到了$j$个代币所用的最小现金数。买第$i+1$件前还剩多少代币可用总代币-买了前$i$件另外获得的代币（即$dp[i][j]$的$j$）-买前$i$件要花多少钱（即$\sum_{k=1}^{i}a_k$）+买前$i$件用了多少现金（即$dp[i][j]$）来计算。然后枚举用了多少现金来转移。
令$M=\sum_{i=1}^n a_i$，则复杂度为$O(\frac{M}{2}\cdot \frac{M}{10}\cdot \frac{1}{2})=O(\frac{M^2}{40})$，对于本题来说为$O(2.5e8)$，具体复杂度分析可用树上两点的贡献仅在$LCA$（最近公共祖先）处被计算的思路求解。

#include <bits/stdc++.h>
using namespace std ;

typedef long long LL ;
typedef pair < int , int > pii ;
typedef unsigned long long ULL ;

#define clr( a , x ) memset ( a , x , sizeof a )

const int MAXN = 5005 ;
const int MAXM = 10005 ;
const int INF = 0x3f3f3f3f ;

short fa[MAXN][MAXM] ;
int dp[2][MAXM] ;
int a[MAXN] ;
int n , m ;

void solve () {
    clr ( dp , INF ) ;
    clr ( fa , 0 ) ;
    dp[0][0] = 0 ;
    int sum = 0 , o = 1 ;
    for ( int i = 1 ; i <= n ; ++ i , o ^= 1 ) {
        scanf ( "%d" , &a[i] ) ;
        int M = ( sum + a[i] ) / 10 ;
        for ( int j = 0 ; j <= M ; ++ j ) {
            dp[o][j] = INF ;
        }
        for ( int j = 0 ; j <= M ; ++ j ) if ( dp[o ^ 1][j] != INF ) {
            int w = dp[o ^ 1][j] ;
            int has = m + j - ( sum - w ) ;
            int t = min ( has , a[i] / 2 ) ;
            for ( int k = 0 ; k <= t ; ++ k ) {
                int nxtw = w + a[i] - k ;
                int nxtj = j + ( a[i] - k ) / 10 ;
                if ( dp[o][nxtj] > nxtw ) {
                    dp[o][nxtj] = nxtw ;
                    fa[i][nxtj] = a[i] - k ;
                }
            }
        }
        sum += a[i] ;
    }
    int ans = INF , pos ;
    for ( int i = 0 ; i < MAXM ; ++ i ) {
        if ( ans > dp[o ^ 1][i] ) {
            ans = dp[o ^ 1][i] ;
            pos = i ;
        }
    }
    vector < int > res ;
    for ( int i = n ; i >= 1 ; -- i ) {
        res.push_back ( fa[i][pos] ) ;
        pos -= fa[i][pos] / 10 ;
    }
    reverse ( res.begin () , res.end () ) ;
    printf ( "%d\n" , ans ) ;
    for ( int i = 0 ; i < n ; ++ i ) {
        printf ( "%d%c" , a[i + 1] - res[i] , i < n - 1 ? ' ' : '\n' ) ;
    }
}

int main () {
    while ( ~scanf ( "%d%d" , &n , &m ) ) solve () ;
    return 0 ;
}