线段树
纯纯的心儿
每天都在赚事业。。
展开
-
hdu 3074 Multiply game
Problem Description Tired of playing computer games, alpc23 is planning to play a game on numbers. Because plus and subtraction is too easy for this gay, he wants to do some multiplication in a num原创 2015-06-09 11:32:12 · 383 阅读 · 0 评论 -
hdu 1394 Minimum Inversion Number(树状数组)
Minimum Inversion Number Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 26 Accepted Submission(s) : 20 Font: Times New Roman | Verdan原创 2015-06-04 17:06:12 · 418 阅读 · 0 评论 -
初识线段树(线段树总结)
线段树的最基本的操作: [1] 建树 : void construct(int left, int right){ int index, mid; node++; index = node; leftvalue[index] = left; rightvalue[index] = right; cover[index] = 0;原创 2015-06-09 23:06:02 · 305 阅读 · 0 评论