h2(#bibliografie). Bibliografie

# '_Arbori de intervale (Segment Trees)_':arbori-de-intervale, Dana Lica
# '_Căutări Ortogonale: Structuri de date şi aplicaţii_':cautari-ortogonale, Cosmin Negruşeri
# '_Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication_':http://www.cosc.canterbury.ac.nz/tad.takaoka/cats02.pdf, Takaoka T.
# '_On the Range Maximum-Sum Segment Query_':http://www.csie.ntu.edu.tw/~kmchao/papers/2007_DAM_RMSQ.pdf, Kuan Yu Chen, Kun Mao Chao
# '_Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecolar Sequence Analysis_':http://www.csie.ntu.edu.tw/~kmchao/seq2003/mslc.pdf, Yaw Ling Liu, Tao Jiang, Kun Mao Chao
# '_Introducere in Algoritmi_':http://zhuzeyuan.hp.infoseek.co.jp/ita/toc.htm, T. H. Cormen, C. E. Leiserson, R. R. Rivest

# Lica Dana, _Arbori de intervale (Segment Trees)_, GInfo 15/4
# Negruşeri Cosmin, _Căutări Ortogonale, Structuri de date şi aplicaţii_, GInfo 15/5
# Takaoka T., _Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication_
# Kuan Yu Chen, Kun Mao Chao, _On the Range Maximum-Sum Segment Query_
# Yaw Ling Liu, Tao Jiang, Kun Mao Chao, _Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecolar Sequence Analysis_
# Vladu Adrian, Negruşeri Cosmin, Ginfo Noiembrie 2005
# T. H. Cormen, C. E. Leiserson, R. R. Rivest - '_Introducere in Algoritmi_':http://zhuzeyuan.hp.infoseek.co.jp/ita/toc.htm