poj 3225 Help with Intervals
来源:互联网 发布:2017中超守门员数据 编辑:程序博客网 时间:2024/05/17 12:05
题目意思不再重复了,有中文的题意
思路:区间的开和闭直接开两倍的点数就可以了,奇数的表示边界点,偶数的表示比边界点大一点点的点。
#include <iostream>
#include <stdio.h>
#include <string.h>
#define ls t<<1
#define rs t<<1|1
#define midt(tr[t].l+tr[t].r)>>1
using namespace std;
const int maxn=65535+1000;
int que[maxn<<1],lon;
struct
{
}tr[maxn<<3];
void maketree(int t,int l,int r)
{
}
void pushdown(int t)
{
}
void pushdownh(int t)
{
}
void modify(int t,int l,int r,int tmp)
{
}
int main()
{
// freopen("in.txt","r",stdin);
}
- poj 3225 Help with Intervals
- poj 2996 Help Me with the Game
- poj 1375 Intervals
- poj 1716 Integer Intervals(差分…
- poj 1201 Intervals (差分约束)
- poj 3468 A Simple Problem with I…
- poj 3468 A Simple Problem with I…
- poj 3468 A Simple Problem with I…
- poj 2488
- POJ 2485 Highways
-  
- POJ 3299
- poj 1905
-
- Program exited with code ****
- Program exited with code **** 2
- resource is out of sync with t…
- POJ 2247 Humble Numbers
- poj 1823 Hotel 线段树
- poj 3667 hotel 线段树…
- poj 3277 City Horizon 线段树
- PHP语言实现验证码
- 一点点感想
- poj 3225 Help with Intervals
- poj 1925 Spiderman
- poj 1850 Code 递推
- poj 1952 BUY LOW, BUY LOWER dp
- poj 2190 isbn 模拟
- poj 3663 Costume Party 二分
- poj 3661 Running dp(动态规划)
- poj 3659 Cell Phone Network 贪心
- poj 2409 Let it Bead