(5124)HDU
来源:互联网 发布:java urlencode编码 编辑:程序博客网 时间:2024/05/16 09:51
#include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#define ll __int64
#define lll unsigned long long
#define eps 1e-8
#define INF 0xfffffff
#define mod 1000000007
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define N 300009
/*
题意:线段树
想法:成段更新离散化
*/
using namespace std;
const int maxn = 300009;
ll add[maxn<<2];//标记并且存储更新的值
ll sum[maxn<<2];//最大值
int X[maxn];//离散数组
int li[maxn];//左节点
int ri[maxn];//右节点
void PushUp(int rt)
{
sum[rt] = max(sum[rt<<1],sum[rt<<1|1]);
}
void PushDown(int rt)
{
if(add[rt])
{
sum[rt<<1]+=add[rt];
sum[rt<<1|1]+=add[rt];
add[rt<<1]+=add[rt];
add[rt<<1|1]+=add[rt];
add[rt]=0;
}
}
void update(int L,int R,int c,int l,int r,int rt)
{
if (L <= l && r <= R)
{
add[rt] += c;
sum[rt] += c;
return ;
}
PushDown(rt);
int m = (l + r) >> 1;
if (L <= m) update(L , R , c , lson);
if (m < R) update(L , R , c , rson);
PushUp(rt);
}
ll query(int L,int R,int l,int r,int rt)
{
if (L <= l && r <= R)
{
return sum[rt];
}
PushDown(rt);
int m = (l + r) >> 1;
ll ret = 0;
if (L <= m) ret = max(ret , query(L , R , lson));
if (R > m) ret = max(ret , query(L , R , rson));
return ret;
}
int bin(int key,int n,int X[])
{
int l = 0,r = n - 1;
while(l<=r)
{
int m = (l + r )>>1;
if(X[m] == key)
return m;
if(X[m]<key)
l = m + 1;
else
r = m - 1;
}
return -1;
}
int main()
{
int n,t ;
int a,b;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
memset(sum,0,sizeof(sum));
memset(add,0,sizeof(add));
int nn = 0;
for(int i = 0; i<n; i++)
{
scanf("%d%d",&li[i],&ri[i]);
X[nn++] = li[i];
X[nn++] = ri[i];
}
sort(X,X+nn);
int m = 1;
for(int j = 1 ; j<nn; j++)
{
if(X[j]!=X[j-1]) X[m++] = X[j];
}
for(int i = m-1; i>0; i--)
{
if(X[i]!=X[i-1]+1)
{
X[m++] = X[i-1]+1;
}
}
sort(X,X+m);
for(int i = 0; i<n; i++)
{
int l = bin(li[i],m,X);
int r = bin(ri[i],m,X);
update(l,r,1,0,m-1,1);
}
printf("%I64d\n",query(1 , N , 1 , N , 1));
}
return 0;
}
#include<cstdio>
#include<string.h>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#define ll __int64
#define lll unsigned long long
#define eps 1e-8
#define INF 0xfffffff
#define mod 1000000007
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define N 300009
/*
题意:线段树
想法:成段更新离散化
*/
using namespace std;
const int maxn = 300009;
ll add[maxn<<2];//标记并且存储更新的值
ll sum[maxn<<2];//最大值
int X[maxn];//离散数组
int li[maxn];//左节点
int ri[maxn];//右节点
void PushUp(int rt)
{
sum[rt] = max(sum[rt<<1],sum[rt<<1|1]);
}
void PushDown(int rt)
{
if(add[rt])
{
sum[rt<<1]+=add[rt];
sum[rt<<1|1]+=add[rt];
add[rt<<1]+=add[rt];
add[rt<<1|1]+=add[rt];
add[rt]=0;
}
}
void update(int L,int R,int c,int l,int r,int rt)
{
if (L <= l && r <= R)
{
add[rt] += c;
sum[rt] += c;
return ;
}
PushDown(rt);
int m = (l + r) >> 1;
if (L <= m) update(L , R , c , lson);
if (m < R) update(L , R , c , rson);
PushUp(rt);
}
ll query(int L,int R,int l,int r,int rt)
{
if (L <= l && r <= R)
{
return sum[rt];
}
PushDown(rt);
int m = (l + r) >> 1;
ll ret = 0;
if (L <= m) ret = max(ret , query(L , R , lson));
if (R > m) ret = max(ret , query(L , R , rson));
return ret;
}
int bin(int key,int n,int X[])
{
int l = 0,r = n - 1;
while(l<=r)
{
int m = (l + r )>>1;
if(X[m] == key)
return m;
if(X[m]<key)
l = m + 1;
else
r = m - 1;
}
return -1;
}
int main()
{
int n,t ;
int a,b;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
memset(sum,0,sizeof(sum));
memset(add,0,sizeof(add));
int nn = 0;
for(int i = 0; i<n; i++)
{
scanf("%d%d",&li[i],&ri[i]);
X[nn++] = li[i];
X[nn++] = ri[i];
}
sort(X,X+nn);
int m = 1;
for(int j = 1 ; j<nn; j++)
{
if(X[j]!=X[j-1]) X[m++] = X[j];
}
for(int i = m-1; i>0; i--)
{
if(X[i]!=X[i-1]+1)
{
X[m++] = X[i-1]+1;
}
}
sort(X,X+m);
for(int i = 0; i<n; i++)
{
int l = bin(li[i],m,X);
int r = bin(ri[i],m,X);
update(l,r,1,0,m-1,1);
}
printf("%I64d\n",query(1 , N , 1 , N , 1));
}
return 0;
}
0 0
- hdu 5124
- hdu 5124
- hdu 5124
- (5124)HDU
- 【瞎搞】HDU 5124 lines
- HDU 5124 lines
- HDU 5124 lines
- HDU 5124 lines
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- 项目3
- ssh port forwarding(ssh端口转发)
- DBA职业生涯规划:八步打造高级DBA专家
- hdu 5199 Gunner
- 阅读《C++Primer》边看边敲代码
- (5124)HDU
- NYOJ 651 Cut the rope(DP, 经典的整数划分问题)
- 黑马程序员——Javase基础--流程控制与函数
- 错误解决:transitive dependencies if any will not be available
- 项目4
- 项目5
- 程序设计C 实验三 题目六 统计出现最多次的字母(0288)
- OC中copy的使用
- poj3641