5013. 珠宝

题目大意

给定$n$个物品，每个物品有代价$C_i$和价值$V_i$。最多可以带$k$的钱，求对于每个可能带的钱数，最大的价值是多少。

Data Constraint
$n\leq1000000,k\leq50000,C_i\leq300$

题解

注意到$C_i$很小，可以按照$C_i$先分类，每类物品按价值从小到大排序。设$f_{i,j}$表示做完前$i$类物品，花了$j$的钱，最多能获得的价值。
可以发现，对于当前的一个位置$f_{i,mid}$它是由$f_{i-1,w}$转移过来，那么$f_{i,1\sim mid}$必定是由$f_{i-1,1\sim w}$转移，$f_{i,mid+1\sim k}$必定是由$f_{i-1,w\sim k}$转移。所以分治转移即可。

SRC

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std ;

#define N 1000000 + 10
typedef long long ll ;

vector < int > a[310] ;

ll f[N] , lasf[N] , nowf[N] , Sum[N] ;
int wz[N] ;
int n , K ;
ll ans ;

bool cmp( int a , int b ) { return a > b ; }

int Read() {
    int ret = 0 ;
    char ch = getchar() ;
    while ( ch < '0' || ch > '9' ) ch = getchar() ;
    while ( ch >= '0' && ch <= '9' ) {
        ret = ret * 10 + ch - '0' ;
        ch = getchar() ;
    }
    return ret ;
}

void Solve( int l , int r , int lasl , int lasr ) {
    if ( l > r ) return ;
    if ( l == r ) {
        nowf[l] = 0 ;
        for (int i = lasl ; i <= lasr ; i ++ ) {
            if ( i > l ) break ;
            nowf[l] = max( nowf[l] , lasf[i] + Sum[l-i] ) ;
        }
        return ;
    }
    int mid = (l + r) >> 1 ;
    int wz = 0 ;
    nowf[mid] = -1 ;
    for (int i = lasl ; i <= lasr ; i ++ ) {
        if ( i > mid ) break ;
        if ( lasf[i] + Sum[mid-i] > nowf[mid] ) {
            nowf[mid] = lasf[i] + Sum[mid-i] ;
            wz = i ;
        }
    }
    Solve( l , mid - 1 , lasl , wz ) ;
    Solve( mid + 1 , r , wz , lasr ) ;
}

int main() {
    freopen( "jewelry.in" , "r" , stdin ) ;
    freopen( "jewelry.out" , "w" , stdout ) ;
    n = Read() , K = Read() ;
    for (int i = 1 ; i <= n ; i ++ ) {
        int c = Read() , v = Read() ;
        a[c].push_back(v) ;
    }
    for (int i = 1 ; i <= 300 ; i ++ ) {
        int Size = a[i].size() ;
        if ( !Size ) continue ;
        sort( a[i].begin() , a[i].end() , cmp ) ;
        for (int j = 1 ; j <= K / i + 1 ; j ++ ) {
            Sum[j] = Sum[j-1] ;
            if ( j <= Size ) Sum[j] += a[i][j-1] ;
        }
        for (int j = 0 ; j < i ; j ++ ) {
            wz[0] = 0 ;
            int x = j ;
            while ( x <= K ) {
                wz[++wz[0]] = x ;
                lasf[wz[0]] = f[x] ;
                x += i ;
            }
            Solve( 1 , wz[0] , 1 , wz[0] ) ;
            for (int k = 1 ; k <= wz[0] ; k ++ ) f[wz[k]] = nowf[k] ;
        }
    }
    for (int i = 1 ; i <= K ; i ++ ) {
        ans = max( ans , f[i] ) ;
        printf( "%lld " , ans ) ;
    }
    return 0 ;
}

以上.