[Usaco07Jan] Balanced Lineup
来源:互联网 发布:奇点网络 编辑:程序博客网 时间:2024/06/08 00:16
题目链接
题解:RMQ模板……
#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
- [Usaco07Jan&luogu2880] Balanced Lineup
- [Usaco07Jan] Balanced Lineup
- [USACO07JAN]平衡的阵容Balanced Lineup
- 洛谷P2880 [USACO07JAN]平衡的阵容Balanced Lineup
- jzoj 1278. 排队 洛谷 P2880 [USACO07JAN]平衡的阵容Balanced Lineup
- Balanced Lineup
- Balanced Lineup
- Balanced Lineup
- Balanced Lineup
- Balanced Lineup
- Balanced Lineup
- Balanced Lineup
- Balanced Lineup
- PKU3274 Gold Balanced Lineup
- pku 3264Balanced Lineup
- POJ 3264 Balanced Lineup
- PKU3264 balanced lineup
- POJ 3264 Balanced Lineup
- const和指针
- 函数指针
- Java多线程详细讲解
- 个人记录-LeetCode 25. Reverse Nodes in k-Group
- MFC之MFC的初始化过程
- [Usaco07Jan] Balanced Lineup
- Python惯例
- 欢迎使用CSDN-markdown编辑器
- 关于LSTM(递归神经网络RNN)的学习资料
- 别样数据结构与算法学习(五)图
- C#中String的常用方法
- 字符流缓冲区
- 剑指offer面试题8
- skynet.记录.编译(ubuntu)