| ||||||||||
| 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 | |||||||||
很奇怪的事情... 线段树+离散化 过了.. 后来再看代码发现没加线段树的销毁, 加了... 结果TL了..??? 附删除函数.. 等待解惑void STree_Del( ST_node *root ) // 删除线段树
{
if(!root) return;
STree_Del( root->lc );
STree_Del( root->rc );
delete root ;
}
难道这个删除的函数很费时???
如果离散化,构造,插入,加搜索线段树才300MS不到...
删除没道理会超过700MS吧....
不理解中... 等待大牛们解惑..
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator