MBLHQ的博客

饭卡 Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16731    Accepted Submission(s): 5818 Problem Description 电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之

0-1背包问题 例： 题目 有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。 解析：这是最简单的0-1背包问题，特点是：每种物品仅有一件，可以选择放或不放。 0-1背包问题的特点： 1.只有两种状态 2.每种元素的数量为一（有时候某种元素的数量不为一，为n，但可以通过转换成n种数量为一的元素，这样就可

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17016    Accepted Submission(s): 6280 Problem Description The aspiring Ro

I NEED A OFFER! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20823    Accepted Submission(s): 8318 Problem Description Speakless

Problem C Knapsack problem Accept: 83    Submit: 457 Time Limit: 3000 mSec    Memory Limit : 32768 KB  Problem Description Given a set of n items, each with a weight w[i] and a value v[i],

Cow Exhibition Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10963   Accepted: 4348 Description "Fat and docile, big and dumb, they look so stupid, they ar

Dima and Salad Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Submit Status Description Dima, Inna and Seryozha have gathered in a room. That's right, some