【CF#189】 A - Cut Ribbon(完全背包|暴力）*

2022.3.25更新

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 4100;
int n,b,c;
int f[N];
int a[10]; 
int main(){
	memset(f,-0x3f,sizeof(f));
	cin >> n >> a[1] >> a[2] >> a[3];
	f[0] = 0;
	for(int i = 1; i <= 3; i++){
		for(int j = a[i]; j <= n; j++){
			f[j] = max(f[j], f[j - a[i]] + 1);
		}
	}
	cout << f[n] << endl;
	return 0;
}

---

完全背包变形
题目链接

---

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 10;
int f[N];
int v[10];
int main(){
	int n,a,b,c;
	cin >> n;//彩带的长度 
	for(int i = 1; i <= 3; i++){
		cin >> v[i];//期望彩带的长度 
	}
	/*之所以要初始化为一个负值，因为要满足被剪开的彩带为a、b、c中的一种*/
	for(int i = 0; i <= n; i++){
		f[i] = -4000;//保险起见,初始化为（a、b、c)值的最大负数。 
	}

	f[0] = 0;//即j - v[i] == 0,仅当j=v[i]时 
	for(int i = 1; i <= 3; i++){
		for(int j = v[i]; j <= n; j++){
			f[j] = max(f[j], f[j - v[i]] + 1);
		}
	} 
	cout << f[n] << endl;
	
	return 0;
}

---

暴力版

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e3 + 10;

ll b[N];
int ans;
int main(){
	int n,a,b,c;
	cin >> n >> a >> b >> c;
	int ans = -1;
	for(int i = 0; i <= n / a; i++){
		for(int j = 0; i * a + j * b <= n; j++){
			if((n - a * i - b * j) % c == 0){
				ans = max(ans,(i + j + (n - a * i - b * j) / c));
			}
		}
	}
	cout << ans << endl;
	return 0;
}