input
11001
1
2 4 0
output
10011
题意:给出一个串,给出m个操作,每个操作输入aa,bb,op,如果op是0,表示将aa~bb区间里面升序排序, 如果op是1,表示将aa~bb区间里面降序排序,问m个操作完成之后字符串是怎么样的。
思路:每次操作的时候可以先把这个范围内全附成0(用延迟标记),并找出这个区间1的个数d,如果是升序排列就将区间后d 个数赋为1,降序就将这个区间前d个数赋值为1。优化就在延迟标记那,具体看代码。不能用cin和cout,会时间超限。
AC代码 (993ms险过)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
#define inf 0x3f3f3f3f
const int mod=1e9+10;
const int M=1e6 + 10;
int a[M]={0};
int tree[M*4]={0};
int Add[M*4]={0};//为1表示赋值为1,-1表示赋值为0
char s[M];
void bulid(int node, int left, int right)//建树
{
if(left == right){
tree[node] = a[left];
return ;
}
int mid = (left + right) / 2;
bulid(node * 2, left, mid);
bulid(node * 2 + 1, mid +1, right);
tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
void PushDown(int now, int ln, int rn)//左右子树叶节点的数量
{
if(Add[now] == 1){//赋值为1操作
Add[now*2] = 1;
Add[now*2+1] = 1;
tree[now*2] = ln;
tree[now*2 + 1] = rn;
Add[now] = 0;
}
else
if(Add[now] == -1){//赋值为0操作
Add[now*2] = -1;
Add[now*2+1] = -1;
tree[now*2] = 0;
tree[now*2 + 1] = 0;
Add[now] = 0;
}
return ;
}
int query(int now, int L, int R, int left, int right)//区间查询
{
if(L <= left && right <= R)
return tree[now];
int mid = (left + right)/2;
PushDown(now, mid- left + 1, right - mid);
int ans = 0;
if(L <= mid )
ans = query(now * 2, L, R, left, mid);
if(R > mid)
ans += query(now * 2 + 1, L, R, mid+1, right);
return ans;
}
//区间更新
void update2(int now, int left, int right, int L, int R, int C)
{
if(L <= left && right <= R)
{
if(C == 0)//清零操作
{
if(Add[now] != 0)//有延迟标记就推下去
{
int mid =(right + left) / 2;
PushDown(now,mid-left+1,right-mid);
}
tree[now] = 0;
Add[now] = -1;
return ;
}
else//赋值为1操作
{
if(Add[now] != 0)
{
int mid=(right + left) / 2;
PushDown(now,mid-left+1,right-mid);
}
tree[now] = right - left + 1;
Add[now] = 1;
return ;
}
}
int mid = (left + right)/2;
PushDown(now,mid-left+1,right-mid);
if(L <= mid)
update2(now*2, left, mid, L, R, C);
if(R >= mid + 1)
update2(now*2+1, mid+1, right, L, R, C);
tree[now] = tree[now*2] + tree[now*2+1];
return ;
}
void OutPut(int left, int right, int now)//递归输出
{
if(left == right)//叶子节点
{
if(tree[now]== 1)
printf("1");
else
printf("0");
return ;
}
if(tree[now] == right - left + 1)//区间全为1
{
for(int i=left;i<=right;i++)
printf("1");
return ;
}
if(tree[now] == 0)//区间全为0
{
for(int i=left;i<=right;i++)
printf("0");
return ;
}
int mid = (left + right) / 2;
PushDown(now,mid-left+1,right-mid);
OutPut(left,mid,now*2);
OutPut(mid+1,right,now*2+1);
}
int main()
{
int n,m,aa,bb,i,j,op;
scanf(" %s",s+1);
n=strlen(s+1);
scanf("%d",&m);
for(i=1;i<=n;i++)
{
if(s[i]=='1')
a[i] = 1;
else
a[i]=0;
}
bulid(1,1,n);
while(m--)
{
scanf("%d%d%d",&aa,&bb,&op);
int d=query(1,aa,bb,1,n);//查询这个区间里面1的个数
if(d == 0 || d == bb-aa+1)//区间全为1或者全为0
continue;
update2(1,1,n,aa,bb,0);//将区间清0
if(op == 0)
update2(1,1,n,bb-d+1,bb,1);//后d个赋值为1
else
update2(1,1,n,aa,aa+d-1,1);//前d个赋值为1
}
OutPut(1,n,1);
return 0;
}