- Category:
- Data structs
- Tags:
-
- File Size:
- 10kb
- Update:
- 2018-01-05
- Downloads:
- 0 Times
- Uploaded by:
- 姚任性
Description: The establishment of a monotonically increasing queue elements from left to right in the team, the team must start from the queue before deleting those questions than the current team elements or equal elements, until a small team than the current element element, or until the queue is empty. If the size of the queue exceeds the window value at this time, the element is deleted from the head of the queue until the queue size is small into the window value. Then insert the current element into the end of the team.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 滑动窗口求最小值.cpp | 2642 | 2018-01-03
|
| 滑动窗口求最小值.exe | 28882 | 2018-01-03
|
| 滑动窗口求最小值.o | 2128 | 2018-01-03 |
Download