BZOJ 4664: Count 插块DP
题解链接
CODE
#pragma GCC optimize (2)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
const int MAXL = 1005;
const int mod = 1e9 + 7;
int dp[2][MAXN][3][MAXL];
int n, L, h[MAXN]...
原创
2019-10-04 13:32:45 ·
214 阅读 ·
0 评论