传送门:点击打开链接
题目大意:
对一个数组有2种操作。
1:左移,将给定的几个位置左移。
2:求区间最小值。
解题思路:
左移。。。呵呵 么见过。怎么搞。再读读题。然后惊讶的发现。Each operation is formatted as a string having no more than 30 characters
那就好办了。弄成单点更新就OK了!
#include <cstdio>
#include <cstring>
#define maxn 100100
struct Node
{
int l,r,mi;
}tree[maxn<<2];
int a[maxn];
inline int min(int x,int y)
{
return x < y ? x : y;
}
inline void pushup(int id)
{
tree[id].mi = min(tree[id<<1].mi,tree[id<<1|1].mi);
}
void build(int id,int l,int r)
{
tree[id].l = l;
tree[id].r = r;
if(l == r)
{
tree[id].mi = a[l];
return ;
}
int mid = (l+r)>>1;
build(id<<1,l,mid);
build(id<<1|1,mid+1,r);
pushup(id);
}
void update(int id,int pos,int x)
{
if(tree[id].l == tree[id].r)
{
tree[id].mi = x;
return ;
}
int mid = (tree[id].l + tree[id].r)>>1;
if(pos <= mid) update(id<<1,pos,x);
else update(id<<1|1,pos,x);
pushup(id);
}
int query(int id,int l,int r)
{
if(l <= tree[id].l && tree[id].r <= r)
{
return tree[id].mi;
}
int mid = (tree[id].l + tree[id].r)>>1;
int res = 0x3f3f3f3f;
if(l <= mid) res = min(res,query(id<<1,l,r));
if(mid < r) res = min(res,query(id<<1|1,l,r));
return res;
}
int main()
{
int n,m;
while(scanf("%d %d",&n,&m) != EOF)
{
for(int i= 1;i <= n;i++) scanf("%d",&a[i]);
build(1,1,n);
while(m--)
{
char s[50];
scanf("%s",s);
if(s[0] == 's')
{
int cnt = 0,tmp = 0,rr[100];
for(int i = 6;i < strlen(s);i++)
{
if(s[i]>= '0' && s[i] <= '9')
tmp = tmp*10+s[i]-'0';
else
{
rr[cnt++] = tmp;
tmp = 0;
}
}
tmp = a[rr[0]];
for(int i = 0;i < cnt-1;i++)
{
update(1,rr[i],a[rr[i+1]]);
a[rr[i]] = a[rr[i+1]];
}
update(1,rr[cnt-1],tmp);
a[rr[cnt-1]] = tmp;
}
else
{
int x,y;
sscanf(s,"query(%d,%d)",&x,&y);
printf("%d\n",query(1,x,y));
}
}
}
return 0;
}