饮酒在风里的博客

Victor and WorldTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 891Accepted Submission(s): 399Problem DescriptionAfter trying har...

有NN种物品和一个容量是VV的背包。物品一共有三类：第一类物品只能用1次（01背包）； 第二类物品可以用无限次（完全背包）； 第三类物品最多只能用sisi次（多重背包）；每种体积是vivi，价值是wiwi。求解将哪些物品装入背包，可使物品体积总和不超过背包容量，且价值总和最大。输出最大价值。输入格式第一行两个整数，N，VN，V，用空格隔开，分别表示物品种...

#include <iostream>#include <cstring>#include <cstdio>#include <queue>#include <cmath>using namespace std;#define mem(f, x) memset(f,x,sizeof(f))#define sca(x) s...

数塔 简单dp从最后一秒开始倒推，特判每一秒的0和10位置#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int dp[100001][12];int main(){ int n,x,...

#include <iostream>#include <ctime>#include <cstdlib>#include <string.h>#include<cstdio>#include<algorithm>using namespace std;int a[1001];//存储每个物品的价值int ...

#include <iostream>#include <ctime>#include <cstdlib>#include <string.h>#include<cstdio>#include<algorithm>using namespace std;int dp[10001];int main(){...

A. Boredomtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlex doesn't like boredom. That's why whenever he gets bored, he comes ...

#include <iostream>#include <algorithm>#include <math.h>#include <vector>#include<cstdio>#include <cstring>#include<bitset>typedef long long ll;usi...

You have been given the job of forming the quiz teams for the next ‘MCA CPCI Quiz Championship’. There are2*Nstudents interested to participate and you have to formNteams, each team consisting of t...

有NN组物品和一个容量是VV的背包。每组物品有若干个，同一组内的物品最多只能选一个。每件物品的体积是vijvij，价值是wijwij，其中ii是组号，jj是组内编号。求解将哪些物品装入背包，可使物品总体积不超过背包容量，且总价值最大。输出最大价值。输入格式第一行有两个整数N，VN，V，用空格隔开，分别表示物品组数和背包容量。接下来有NN组数据：...