Wavelet Tree - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼åœ§ç¸®å…¨æ–‡ç´¢å¼•ã®å®Ÿè£…ãªã©ã§ã—ã°ã—ã°åˆ©ç”¨ã•ã‚Œã‚‹ Rank/Select 辞書ã¨å‘¼ã°ã‚Œã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ãŒã‚ã‚Šã¾ã™ã€‚詳ã—ãã¯å‚考文献をå‚ç…§ã—ã¦ã„ãŸã ãã¨ã—ã¦ã€ä»Šå›žã¯ä¸€èˆ¬ã®æ–‡å—列ã«å¯¾ã—ã¦åŠ¹çŽ‡çš„ã« Rank/Select ã‚’å¯èƒ½ã¨ã™ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚ã‚‹ Wavelet Tree (ウェーブレット木) ã®ãƒ©ã‚¤ãƒ–ラリを作りã¾ã—ãŸã€‚ http://github.com/naoya/perl-algorithm-wavelettree/tree/master my $wt = Algorithm::WaveletTree->new("abccbbabca"); is $wt->rank(6, 'a'), 2; is $wt->rank(6, 'b'), 3; is $wt->rank(9, 'b'), 4; is $wt->select(0, 'a'), 0; is $wt->select(1, 'a'), 6;
{{#tags}}- {{label}}
{{/tags}}