状态压缩dp
newhonor
可以不伟大,但不能卑微
展开
-
HihoCoder - 1486
https://cn.vjudge.net/problem/HihoCoder-1486题意:给出每个物品的价值val和属性(1~m)(m<=10);取一些使得这些的各种属性数都是奇数求最大价值;思路:状态呀说dp;把属性压缩;异或后是各位是一就是奇数;要先初始化dp[i][0]=0;dp[i][j]=dp[i-1][j]每次多要更新的,后面会用到;#include<a...原创 2019-04-06 14:44:29 · 164 阅读 · 0 评论 -
F. Military Class
https://codeforc.es/gym/102219/problem/F思路:状态压缩dp;e很小可以压缩;dp[i][j]表示:第i个人和状态j的个数;#include<algorithm>#include<set>#include<cmath>#include<cstring>#include<iostre...原创 2019-07-09 09:39:24 · 445 阅读 · 0 评论 -
Music Festival Gym - 101908F
https://cn.vjudge.net/problem/Gym-101908F#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inc...原创 2019-08-22 17:35:14 · 138 阅读 · 0 评论 -
Maximum Sum Gym - 101853E
https://cn.vjudge.net/problem/Gym-101853E#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-09-04 21:31:37 · 123 阅读 · 0 评论 -
Explosion Exploit Gym - 101933E
https://vjudge.net/problem/Gym-101933E#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include ...原创 2019-10-03 16:13:34 · 181 阅读 · 0 评论