當前位置：首頁 > 编程资源 > 编程问答 >内容正文

编程问答

Charm Bracelet(0-1)

發布時間：2025/3/16 编程问答 20 豆豆

生活随笔收集整理的這篇文章主要介紹了 Charm Bracelet(0-1) 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the?N(1 ≤?N≤ 3,402) available charms. Each charm?iin the supplied list has a weight?W_i(1 ≤?W_i≤ 400), a 'desirability' factor?D_i(1 ≤?D_i≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than?M(1 ≤?M≤ 12,880).

Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.

輸入

Line 1: Two space-separated integers: N and M
Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: W_i?and D_i

輸出

Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

樣例輸入

4 6 1 4 2 6 3 12 2 7

樣例輸出

AC代碼：

#include<bits/stdc++.h> using namespace std; int main() {int T,M,i,s;int a[40000],b[40000],c[40000];while(cin>>M>>T){for(i=1;i<=M;i++)cin>>a[i]>>b[i];memset(c,0,sizeof(c));for(i=1;i<=M;i++)for(s=T;s>=a[i];s--)if(c[s]<c[s-a[i]]+b[i])c[s]=c[s-a[i]]+b[i];cout<<c[T]<<endl;}return 0; }

與50位技術專家面對面20年技術見證，附贈技術全景圖

總結

以上是生活随笔為你收集整理的Charm Bracelet(0-1)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。