Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #72.7K
|
#include<iostream> #define MAX 1000000 #define loop0(i,j) for(int i=0;i<j;i++) #define loop1(i,j) for(int i=1;i<j;i++) using namespace std; bool flag[MAX]={0}; int tree[MAX]={0}; void update(long int node,long int b,long int e,long int i,long int j) { if(b>j || e<i) return; if(b>=i && e<=j) { if(flag[node]) { flag[node]=0; return; } else { tree[node]=e-b+1-tree[node]; flag[2*node]=!flag[2*node]; flag[2*node+1]=!flag[2*node+1]; …
|