#include<iostream>
#include<algorithm>
#include<string.h>;
int V[11] = { 0, 90, 85, 81, 78, 75, 72, 68, 64, 60, 0 }; //分数
double A[11] = { 0, 4.0, 3.7, 3.3, 3.0, 2.7, 2.3, 2.0, 1.7, 1.0, 0.0 }; //绩点
using namespace std;
int main() {
int n, v;
n = 4;
while (cin >> v) {
double dp[n + 5][v + 5];
memset(dp, 0, sizeof dp);
for (int i = 1; i <= n; i++) {//第i组背包
for (int j = v; j >= 0; j--) { //现在体积
for (int k = 1; k <= 10; k++) {//选择前j个物品
if (j >= V[k]) {
dp[i][j] = max(dp[i][j], dp[i - 1][j - V[k]] + A[k]);
}
}
}
}
printf("%.1lf\n", dp[n][v]);
}
return 0;
}
动态规划(背包)
于 2024-03-14 23:31:34 首次发布