Vincehex

戳气球 class Solution { public: int maxCoins(vector<int>& nums) { nums.push_back(1); nums.insert(nums.begin(), 1); int n = nums.size(); vector<vector<int>> dp(n, vector<int>(n)); for(int

玉米田 #include<bits/stdc++.h> using namespace std; const int mod = 100000000; int b[20][20] = {0}, f[20][1 << 15] = {0}; int main() { int m, n; scanf("%d%d", &m, &n); for(int i =...

题目 #include<bits/stdc++.h> #define rep(i, a, b) for(int i = a; i <= b; ++i) using namespace std; const int maxn = 4e3 + 3; int val[maxn], to[maxn], nx[maxn], hd[maxn], cnt = 0; int f[maxn][4...

题目 也可以用DFS做，更快 class Solution { public: bool canPartition(vector<int>& nums) { int sum=0; for(auto i:nums) sum+=i; if(sum&1) return 0;...