做回菜鸟,老老实实重新学起:
Sparse Table
一维:
构造RMQ数组:
ST(int n) O(nlog(n))的算法复杂度
dp[i][j] 表示从i到i+2^j -1中最小的一个值(从i开始持续2^j个数)
dp[i][j]=max{dp[i][j-1],dp[i+2^(j-1)][j-1]}
查询RMQ:
RMQ(int i,int j)
将i-j 分成两个2^k的区间
即 k=(int)log2(i-j+1)
查询结果应该为 max(f2[i][k],f2[j-2^k+1][k])
int dp[N][35],num[N];
void ST(int n)
{
for(int i=0;i<n;i++)
dp[i][0] = num[i];//递推的初值
int k = (int)(log((double)n) / log(2.0));
for(int j=1;j<=k;j++)//自底向上递推
{
for(int i=0;i+(1<<j)-1<n;i++)
{
int m = i+(1<<(j-1));//求出中间的那个值
dp[i][j] = max(dp[i][j-1], dp[m][j-1]);
}
}
}
int RMQ(int l,int r)//查询i和j之间的最值,注意i是从0开始的
{
int mid = (int)(log((double)(r-l+1)) / log(2.0));
int t = max(dp[l][mid],dp[r-(1<<mid)+1][mid]);
return t;
}
二维:
构造RMQ数组:
ST() O(n*n*log(n)*log(n))的算法复杂度
dp[r][l][i][j] 表示从r到r+2^i -1和l到l+2^j-1中最小的一个值(从(r,l)到(r+2^i -1,l+2^j-1)的矩形)
int dp[N][N][32][32];//careful memory limit
int val[N][N];
void ST()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
dp[i][j][0][0] = val[i-1][j-1];//递推的初值
int k = (int)(log((double)n) / log(2.0));
for(int i=0;i<=k;i++)
for(int j=0;j<=k;j++)
{
if(i==0 && j==0)
continue;
for(int r=1;r+(1<<i)-1<=n;r++)
for(int l=1;l+(1<<j)-1<=n;l++)
{
if (i == 0) //只有一行时横向更新
dp[r][l][i][j] = max(dp[r][l][i][j-1], dp[r][l+(1<<(j-1))][i][j-1]);
else
dp[r][l][i][j] = max(dp[r][l][i-1][j], dp[r+(1<<(i-1))][l][i-1][j]);
}
}
}
int RMQ(int r,int l,int rr,int ll)
{
int kr = (int)(log((double)(rr-r+1)) / log(2.0));
int kl = (int)(log((double)(ll-l+1)) / log(2.0));
int t1 = dp[r][l][kr][kl];
int t2 = dp[rr-(1<<kr)+1][l][kr][kl];
int t3 = dp[r][ll-(1<<kl)+1][kr][kl];
int t4 = dp[rr-(1<<kr)+1][ll-(1<<kl)+1][kr][kl];
return max(max(t1, t2), max(t3, t4));
}
查询RMQ:
RMQ(int i,int j)
将i-j 分成两个2^k的区间
即 k=(int)log2(i-j+1)
查询结果应该为 min(f2[i][k],f2[j-2^k+1][k])
eg:
POJ3368
http://poj.org/problem?id=3368
题意:
求范围内最频繁数出现次数;
思路:
f[]存连续相同数个数,RMQ模版;
code:
int n,m;
int flag,sum,ave,ans,res;
int dp[N][35],num[N],f[N];
void ST(int n)
{
for(int i=0;i<n;i++)
dp[i][0] = f[i];//递推的初值
int k = (int)(log((double)n) / log(2.0));
for(int j=1;j<=k;j++)//自底向上递推
{
for(int i=0;i+(1<<j)-1<n;i++)
{
int m = i+(1<<(j-1));//求出中间的那个值
dp[i][j] = max(dp[i][j-1], dp[m][j-1]);
}
}
}
int RMQ(int l,int r)//查询i和j之间的最值,注意i是从0开始的
{
if(l>r) return 0;
int mid = (int)(log((double)(r-l+1)) / log(2.0));
int t = max(dp[l][mid],dp[r-(1<<mid)+1][mid]);
return t;
}
int main()
{
int i,j,k,kk,t,x,y,d;
#ifndef ONLINE_JUDGE
freopen("test.txt","r",stdin);
#endif
while(scanf("%d",&n)!=EOF&&n)
{
scanf("%d",&m);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
if(i>0 && num[i]==num[i-1])
f[i] = f[i-1]+1;
else
f[i] = 1;
}
ST(n);
for(i=0;i<m;i++)
{
scanf("%d%d",&x,&y);
t = x;
while(t<=y && num[t-1]==num[t-2])
t++;
d = RMQ(t-1,y-1);
res = max(d,t-x);
printf("%d\n",res);
}
}
return 0;
}
POJ3264
http://poj.org/problem?id=3264
题意:
求范围内最大差值;
思路:
求区间最大最小值差值,RMQ模版;
code:
int n,m;
int flag,sum,ave,ans,res;
int dp1[N][35],dp2[N][35],num[N];
void ST(int n)
{
for(int i=0;i<n;i++)
dp1[i][0] = dp2[i][0] = num[i];//递推的初值
int k = (int)(log((double)n) / log(2.0));
for(int j=1;j<=k;j++)//自底向上递推
{
for(int i=0;i+(1<<j)-1<n;i++)
{
int m = i+(1<<(j-1));//求出中间的那个值
dp1[i][j] = max(dp1[i][j-1], dp1[m][j-1]);
dp2[i][j] = min(dp2[i][j-1], dp2[m][j-1]);
}
}
}
int RMQ(int l,int r)//查询i和j之间的最值,注意i是从0开始的
{
int mid = (int)(log((double)(r-l+1)) / log(2.0));
int t = max(dp1[l][mid],dp1[r-(1<<mid)+1][mid]);
int tt = min(dp2[l][mid],dp2[r-(1<<mid)+1][mid]);
return t-tt;
}
int main()
{
int i,j,k,kk,t,x,y;
#ifndef ONLINE_JUDGE
freopen("test.txt","r",stdin);
#endif
while(scanf("%d",&n)!=EOF&&n)
{
scanf("%d",&m);
for(i=0;i<n;i++)
scanf("%d",&num[i]);
ST(n);
for(i=0;i<m;i++)
{
scanf("%d%d",&x,&y);
res = RMQ(x-1,y-1);
printf("%d\n",res);
}
}
return 0;
}
POJ2019
http://poj.org/problem?id=2019
题意:
求范围内最大差值(二维);
思路:
求区间最大最小值差值,RMQ模版;
code:
const int maxn = 255;
int n, b, k;
int dp2[maxn][maxn][8][8];
int dp1[maxn][maxn][8][8];
int val[maxn][maxn];
void ST()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
dp1[i][j][0][0] = dp2[i][j][0][0] = val[i-1][j-1];//递推的初值
int k = (int)(log((double)n) / log(2.0));
for(int i=0;i<=k;i++)//自底向上递推
for(int j=0;j<=k;j++)
{
if(i==0 && j==0)
continue;
for(int r=1;r+(1<<i)-1<=n;r++)
for(int l=1;l+(1<<j)-1<=n;l++)
{
if (i == 0)
{
dp2[r][l][i][j] = min(dp2[r][l][i][j-1], dp2[r][l+(1<<(j-1))][i][j-1]);
dp1[r][l][i][j] = max(dp1[r][l][i][j-1], dp1[r][l+(1<<(j-1))][i][j-1]);
}
else
{
dp2[r][l][i][j] = min(dp2[r][l][i-1][j], dp2[r+(1<<(i-1))][l][i-1][j]);
dp1[r][l][i][j] = max(dp1[r][l][i-1][j], dp1[r+(1<<(i-1))][l][i-1][j]);
}
}
}
}
int RMQ(int r,int l,int rr,int ll)
{
int kr = (int)(log((double)(rr-r+1)) / log(2.0));
int kl = (int)(log((double)(ll-l+1)) / log(2.0));
int t1 = dp1[r][l][kr][kl];
int t2 = dp1[rr-(1<<kr)+1][l][kr][kl];
int t3 = dp1[r][ll-(1<<kl)+1][kr][kl];
int t4 = dp1[rr-(1<<kr)+1][ll-(1<<kl)+1][kr][kl];
int m1 = dp2[r][l][kr][kl];
int m2 = dp2[rr-(1<<kr)+1][l][kr][kl];
int m3 = dp2[r][ll-(1<<kl)+1][kr][kl];
int m4 = dp2[rr-(1<<kr)+1][ll-(1<<kl)+1][kr][kl];
return max(max(t1, t2), max(t3, t4)) - min(min(m1, m2), min(m3, m4));
}
int main()
{
int i,j,k,kk,t,x,xx,y,yy,b;
#ifndef ONLINE_JUDGE
freopen("test.txt","r",stdin);
#endif
while(scanf("%d%d%d",&n,&b,&k)!=EOF&&n)
{
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&val[i][j]);
ST();
for(i=0;i<k;i++)
{
scanf("%d%d",&x,&y);
xx = x+b-1;
yy = y+b-1;
printf("%d\n",RMQ(x,y,xx,yy));
}
}
return 0;
}