1636: [Usaco2007 Jan]Balanced Lineup
来源:互联网 发布:淘宝买家秀福利地址 编辑:程序博客网 时间:2024/05/24 01:09
题目链接
题目大意:多次询问区间最大减去最小
题解:两个st表即可
我的收获:水
#include <cstdio>#include <cmath>#include <iostream>using namespace std;#define pow2(x) (1<<(x))const int M=50005;int n,T,x,y;int a[M],Fmin[M][25],Fmax[M][25];void max_rmq(){ for(int i=1;i<=n;i++) Fmax[i][0]=a[i]; for(int j=1;j<=20;j++) for(int i=1;i+pow2(j)-1<=n;i++) Fmax[i][j]=max(Fmax[i][j-1],Fmax[i+pow2(j-1)][j-1]); }int max_query(int i,int j){ int k=log(j-i+1)/log(2); return max(Fmax[i][k],Fmax[j-pow2(k)+1][k]); } void min_rmq(){ for(int i=1;i<=n;i++) Fmin[i][0]=a[i]; for(int j=1;j<=20;j++) for(int i=1;i+pow2(j)-1<=n;i++) Fmin[i][j]=min(Fmin[i][j-1],Fmin[i+pow2(j-1)][j-1]); }int min_query(int i,int j){ int k=log(j-i+1)/log(2); return min(Fmin[i][k],Fmin[j-pow2(k)+1][k]); } int main(){ cin>>n>>T; for(int i=1;i<=n;i++) scanf("%d",&a[i]); min_rmq(); max_rmq(); while(T--) { scanf("%d%d",&x,&y); printf("%d\n",max_query(x,y)-min_query(x,y)); } return 0;}
阅读全文
0 0
- 1636: [Usaco2007 Jan]Balanced Lineup
- BZOJ 1636: [Usaco2007 Jan]Balanced Lineup
- 【BZOJ 1636】 [Usaco2007 Jan]Balanced Lineup
- BZOJ 1636: [Usaco2007 Jan]Balanced Lineup
- BZOJ 1636: [Usaco2007 Jan]Balanced Lineup
- BZOJ 1636: [Usaco2007 Jan]Balanced Lineup
- 【bzoj1636】[Usaco2007 Jan]Balanced Lineup
- bzoj1636: [Usaco2007 Jan]Balanced Lineup
- bzoj1699[Usaco2007 Jan]Balanced Lineup排队
- BZOJ 1699: [Usaco2007 Jan]Balanced Lineup排队
- bzoj 1699: [Usaco2007 Jan]Balanced Lineup排队
- [BZOJ1699][Usaco2007 Jan]Balanced Lineup排队
- bzoj1636&bzoj1699【Usaco2007 Jan】Balanced Lineup
- BZOJ 1699 [USACO2007 Jan] Balanced Lineup排队
- 【bzoj 1699】[Usaco2007 Jan]Balanced Lineup排队
- 【bzoj1699】[Usaco2007 Jan]Balanced Lineup排队
- 【bzoj1699】[Usaco2007 Jan][Balanced Lineup排队]
- bzoj1699 [Usaco2007 Jan]Balanced Lineup排队
- javascript原型遍历数组
- c++ struct
- Unity 通过代码获取从面板传入的mono脚本,并添加为GameObject的脚本组件
- redhat7 nfs的配置以及auto自动挂载
- Android学习之RatingBar,SeekBar,ToggleButton,Switch
- 1636: [Usaco2007 Jan]Balanced Lineup
- 【FirstKotlinApp】使用Kotlin实现简单的Banner广告条(一)
- 1638: [Usaco2007 Mar]Cow Traffic 奶牛交通
- 前端,修改this指针
- 1651: [Usaco2006 Feb]Stall Reservations 专用牛棚
- c++实现加法器
- ZooKeeper学习第七期--ZooKeeper一致性原理
- 进度条
- 1468: Tree