nbut专题

NBUT 1480hdu 2844 (多重背包)

两题题意不再赘述  虽然描述不同 但是意思是一样的。。。而且两题的代码也是一样的。。。。 下面给出O(log amount)时间处理一件多重背包中物品的过程,其中amount表示物品的数量: procedure MultiplePack(cost,weight,amount) if cost*amount>=V CompletePack(cost,weight)

NBUT 1223 Friends number (打表)

[1223] Friends number 时间限制: 1000 ms 内存限制: 131072 K问题描述   Paula and Tai are couple. There are many stories between them. The day Paula left by airplane, Tai send one message to telephone 2200284

NBUT 1457 Sona(莫队算法+离散化)

题目链接:点击打开链接 [1457] Sona 时间限制: 5000 ms 内存限制: 65535 K 问题描述 Sona, Maven of the Strings. Of cause, she can play the zither. Sona can't speak but she can make fancy music. Her music can attack, heal, en