poj 3468 A Simple Problem with Integers
摘要:
#includestruct CNode{ int L,R; long long nSum; long long Inc; CNode *pLeft,*pRight;};CNode Tree[1000000];int nCount;int Mid(CNode *pRoot){ return (pRoot->L+pRoot->R)/2;}void BuildTree(CNode *pRoot,int L,int R){ pRoot->L=L; pRoot->R=R; pRoot->nSum=0; pRoot->Inc=0; if(L==... 阅读全文
posted @ 2013-08-21 21:42 雨钝风轻 阅读(218) 评论(0) 推荐(0) 编辑