摘要：
数组下标0-n-1，询问区间最值int dp[100005][20];void makermq(int n, int *a) { for(int i = 0; i < n; i++) dp[i][0] = a[i]; for(int j = 1; (1<<j) <= n; ... 阅读全文
posted @ 2014-05-14 19:11
LegendaryAC
阅读(109)
评论(0)
推荐(0)
