mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-08 15:18:46 +00:00
parent
68041768d2
commit
f9de72ecb4
42
Luogu/P1776/P1776.cpp
Normal file
42
Luogu/P1776/P1776.cpp
Normal file
@ -0,0 +1,42 @@
|
||||
#include <iostream>
|
||||
#include <deque>
|
||||
|
||||
using std::cin;
|
||||
using std::cout;
|
||||
const char endl = '\n';
|
||||
|
||||
const int N = 105,
|
||||
W = 4e4 + 5;
|
||||
|
||||
int n, k, v[N], w[N], s[N], f[W];
|
||||
|
||||
int main() {
|
||||
std::ios::sync_with_stdio(false);
|
||||
cin.tie(nullptr);
|
||||
|
||||
cin >> n >> k;
|
||||
|
||||
for (int i = 1; i <= n; i++) {
|
||||
cin >> v[i] >> w[i] >> s[i];
|
||||
}
|
||||
|
||||
for (int i = 1; i <= n; i++) {
|
||||
int x = std::min(s[i], k / w[i]);
|
||||
for (int j = 0; j < w[i]; j++) {
|
||||
std::deque<std::pair<int, int>> q;
|
||||
|
||||
int t = (k - j) / w[i];
|
||||
for (int k = 0; k <= t; k++) {
|
||||
while (!q.empty() && q.back().second <= f[j + k * w[i]] - k * v[i]) q.pop_back();
|
||||
q.push_back(std::make_pair(k, f[j + k * w[i]] - k * v[i]));
|
||||
while (!q.empty() && q.front().first + x < k) q.pop_front();
|
||||
|
||||
f[j + k * w[i]] = std::max(f[j + k * w[i]], q.front().second + k * v[i]);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
cout << f[k] << endl;
|
||||
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user