LA 2191 Potentiometers
#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase) printf("Case %d:\n",kcase);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl; \
}
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
#define MAXN (200010+10)
int n;
ll f[MAXN],a[MAXN];
void add(int x,ll v) {
for(int i=x;i<=n;i+=i&(-i))
f[i]+=v;
}
ll qur(int x) {
ll v=0;
for(int i=x;i;i-=i&(-i))
v+=f[i];
return v;
}
int main()
{
// freopen("la2192.in","r",stdin);
// freopen(".out","w",stdout);
int kcase=1;
while(cin>>n&&n) {
if (kcase>1) puts("");
Pr(kcase++)
MEM(f)
For(i,n) scanf("%lld",&a[i]);
For(i,n) add(i,a[i]);
char s[10];
while(scanf("%s",s)&&strcmp(s,"END")) {
int p1,p2;
scanf("%d%d",&p1,&p2);
if (s[0]=='M'){
printf("%lld\n",qur(p2)-qur(p1-1));
}
else{
add(p1,p2-a[p1]);
a[p1]=p2;
}
}
}
return 0;
}
LA 5902 Movie Collection
#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase) printf("Case %d:\n",kcase);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl; \
}
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
#define MAXN (200010+10)
int n,m;
ll f[MAXN],a[MAXN];
void add(int x,ll v) {
for(int i=x;i<=n+m;i+=i&(-i))
f[i]+=v;
}
ll qur(int x) {
ll v=0;
for(int i=x;i;i-=i&(-i))
v+=f[i];
return v;
}
int main()
{
// freopen("la5902.in","r",stdin);
// freopen(".out","w",stdout);
int T=read();
while(cin>>n>>m) {
MEM(f)
For(i,n) add(i,1),a[n-i+1]=i;
char s[10];
For(i,m) {
int p=read();
printf("%d",qur(n+i)-qur(a[p]));
if (i<m) putchar(' '); else puts("");
add(a[p],-1);
a[p]=n+i;
add(a[p],1);
}
For(i,m) {
}
}
return 0;
}
LA 4108 SKYLINE
对于区间操作:对[l,r]把
#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl; \
}
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
#define MAXN (2000000+10)
ll ans=0;
ll setv[MAXN<<2],minv[MAXN<<2],maxv[MAXN<<2];
void pushUp(int o) {
minv[o]=min(minv[Lson],minv[Rson]);
maxv[o]=max(maxv[Lson],maxv[Rson]);
}
void pushDown(int o,ll m) {
if (setv[o]!=-1) {
minv[Lson]=minv[Rson]=setv[Lson]=setv[Rson]=maxv[Lson]=maxv[Rson]=setv[o];
setv[o]=-1;
}
}
void update(int l,int r,int o,int L,int R,ll c) {
if (minv[o]>c) return;
if (l==r) {
++ans;
if (minv[o]<c) minv[o]=maxv[o]=c;
return;
}
pushDown(o,r-l+1);
if (maxv[o]<=c&&L<=l&&r<=R) {
// cout<<l<<' '<<r<<endl;
setv[o]=minv[o]=maxv[o]=c;
ans+=(r-l+1); return;
}
int m=(l+r)>>1;
if (L<=m) update(l,m,Lson,L,R,c);
if (m<R) update(m+1,r,Rson,L,R,c);
pushUp(o);
}
int main()
{
// freopen("la4108.in","r",stdin);
// freopen(".out","w",stdout);
int T=read();
while(T--) {
int n=read(); ans=0;
MEMx(setv,-1) MEM(minv) MEM(maxv)
For(i,n) {
int l=read()+1,r=read(),h=read();
update(1,2000000,1,l,r,h);
}
cout<<ans<<endl;
}
return 0;
}
LA 4730 Kingdom
用并查集维护一个连通块的y区间,然后区间修改单点求和
#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %I64d\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl; \
}
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int n,m;
struct BIT{
#define MAXN (1000000+10)
ll f[MAXN],f2[MAXN];
void add(int x,ll v,ll v2) {
for(int i=x;i<=1000000;i+=i&(-i))
f[i]+=v, f2[i]+=v2;
}
pair<ll,ll> qur(int x) {
ll v=0,v2=0;
for(int i=x;i;i-=i&(-i))
v+=f[i],v2+=f2[i];
return mp(v2,v);
}
}T;
int x[MAXN],y[MAXN];
class bingchaji
{
public:
int father[MAXN],sz[MAXN],l[MAXN],r[MAXN],n;
void mem(int _n)
{
n=_n;
For(i,n) father[i]=i,sz[i]=1,l[i]=r[i]=y[i];
}
int getfather(int x)
{
if (father[x]==x) return x;
return father[x]=getfather(father[x]);
}
void unite(int x,int y)
{
x=getfather(x),y=getfather(y);
if (x==y) return;
if (sz[x]!=1) T.add(l[x]+1,-sz[x],-1),T.add(r[x]+1,sz[x],1);
if (sz[y]!=1) T.add(l[y]+1,-sz[y],-1),T.add(r[y]+1,sz[y],1);
father[x]=y;
sz[y]+=sz[x];
l[y]=min(l[x],l[y]),r[y]=max(r[x],r[y]);
T.add(l[y]+1,sz[y],1),T.add(r[y]+1,-sz[y],-1);
}
bool same(int x,int y)
{
return getfather(x)==getfather(y);
}
}S;
int main()
{
// freopen("la4730.in","r",stdin);
// freopen(".out","w",stdout);
int t=read();
while(t--) {
n=read();
For(i,n) read(),y[i]=read();
MEM(T.f) MEM(T.f2) S.mem(n);
m=read();
while(m--) {
char op[10];
scanf("%s",op);
if (op[0]=='r') {
int u=read(),v=read(); u++,v++;
S.unite(u,v);
}else {
double c;
cin>>c; int p=round(c+0.5);
pair<ll,ll> ans=T.qur(p);
printf("%lld %lld\n",ans.first,ans.se);
}
}
}
return 0;
}