HDU - 5443 - The Water Problem (RMQ板子)
#include <bits/stdc++.h>using namespace std;const int maxn = 1000 + 10;int dp[maxn][maxn];int A[maxn];void ST(int n){ for(int i = 1; i <= n; i++) dp[i][0] = A[i]; for(i...
原创
2019-02-02 21:38:46 ·
221 阅读 ·
0 评论