Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

用线段树返回离查询点最近的点的坐标即可水过！

Posted by 117474335 at 2010-11-01 19:38:56 on Problem 2892

再贴一个主要函数：
void search1 (int nu, int x)
{
    int mi = (tr[nu].a + tr[nu].b) >> 1 ;
    if (tr[nu].a == tr[nu].b){
        if (tr[nu].v) e1 = tr[nu].a; 
        return ;}
    if (x > mi && tr[nu << 1 | 1].v) search1 (nu << 1 | 1, x) ;
    if (!e1) search1 (nu << 1 , x) ;
}

Followed by:

真正的强人这个题都是用树状数组的 (0) applepi 2010-11-01 23:10:35
同楼主，线段树水过 (9) comzyh 2010-11-03 02:15:39

Post your reply here:

Home Page Go Back To top