HDU 5323 SOLVE THIS INTERESTING PROBLEM 爆搜
2015-07-28 20:12
302 查看
链接
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 511 Accepted Submission(s): 114
Problem Description
Have you learned something about segment tree? If not, don’t worry, I will explain it for you.
Segment Tree is a kind of binary tree, it can be defined as this:
- For each node u in Segment Tree, u has two values: Lu and Ru.
- If Lu=Ru,
u is a leaf node.
- If Lu≠Ru,
u has two children x and y,with Lx=Lu,Rx=⌊Lu+Ru2⌋,Ly=⌊Lu+Ru2⌋+1,Ry=Ru.
Here is an example of segment tree to do range query of sum.
Given two integers L and R, Your task is to find the minimum non-negative n satisfy that: A Segment Tree with root node's value Lroot=0 and Rroot=ncontains
a node u with Lu=L and Ru=R.
Input
The input consists of several test cases.
Each test case contains two integers L and R, as described above.
0≤L≤R≤109
LR−L+1≤2015
Output
For each test, output one line contains one integer. If there is no such n, just output -1.
Sample Input
Sample Output
Source
2015 Multi-University Training Contest 3
题意:
给定区间[l,r]
用线段树的递归建树方式build(1, n)
问最小的n是多少,使得build(1,n) 中能直接建出区间[l,r]
思路:
注意一下范围,然后推算一下就能发现这个区间距离根节点的距离不超过10
所以从底向上搜就好了
代码
Solve this interesting problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 511 Accepted Submission(s): 114
Problem Description
Have you learned something about segment tree? If not, don’t worry, I will explain it for you.
Segment Tree is a kind of binary tree, it can be defined as this:
- For each node u in Segment Tree, u has two values: Lu and Ru.
- If Lu=Ru,
u is a leaf node.
- If Lu≠Ru,
u has two children x and y,with Lx=Lu,Rx=⌊Lu+Ru2⌋,Ly=⌊Lu+Ru2⌋+1,Ry=Ru.
Here is an example of segment tree to do range query of sum.
Given two integers L and R, Your task is to find the minimum non-negative n satisfy that: A Segment Tree with root node's value Lroot=0 and Rroot=ncontains
a node u with Lu=L and Ru=R.
Input
The input consists of several test cases.
Each test case contains two integers L and R, as described above.
0≤L≤R≤109
LR−L+1≤2015
Output
For each test, output one line contains one integer. If there is no such n, just output -1.
Sample Input
6 7 10 13 10 11
Sample Output
7 -1 12
Source
2015 Multi-University Training Contest 3
题意:
给定区间[l,r]
用线段树的递归建树方式build(1, n)
问最小的n是多少,使得build(1,n) 中能直接建出区间[l,r]
思路:
注意一下范围,然后推算一下就能发现这个区间距离根节点的距离不超过10
所以从底向上搜就好了
代码
相关文章推荐
- 获取进程CPU占用率 -- NtQuerySystemInformation
- AndroidManifest.xml
- Search for a Range
- [hdu5323]复杂度计算,dfs
- eclipse下安装tomcat以及可能遇到的404问题
- hdu杭电4006 The kth great number【优先队列】
- linux中的权限对于文件和目录的重要性
- (BC 一周年)hdu 5310 Souvenir
- 每天一个小知识点16(Angularjs总结四)
- Python的面向对象、Class 概念与使用
- OC内存管理
- [Android] ImageView.ScaleType设置图解
- 暴力求解——Equivalent Strings
- 软件测试方法和测试流程
- Python的面向对象、Class 概念与使用
- hdoj 1873 看病要排队 [STL 优先队列]
- linux job control学习整理
- Ubuntu循环登录问题解决方案
- win7安装ruby on rails开发环境
- byte[]数据写成文件