and 2 others joined a min ago.
0
56kviews
Explain DGIM algorithm for counting ones in a window
1 Answer
3
6.3kviews
written 8.0 years ago by
teamques10
★ 65k
|
Suppose we have a window of length N on a binary stream. We want at all times to be able to answer queries of the form “how many 1’s are there in the last k bits?” for any k≤ N. For this purpose we use the DGIM algorithm.
The basic …
and 2 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.