摘要:
Fennec VS. Snuke Time limit : 2sec / Memory limit : 256MB Score : 400 points Problem Statement Fennec and Snuke are playing a board game. On the board 阅读全文
摘要:
Splitting Pile Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement Snuke and Raccoon have a heap of N cards. The i-th card f 阅读全文
摘要:
离线RAQ时,预处理为O(n*lgn),查询为O(1)的算法,比较有意思的一种算法 放个模板在这可以随时看 1 //ST表(离线) 2 //预处理 O(n*lgn) , 查询 O(1) 3 #include <iostream> 4 #include <stdio.h> 5 using namesp 阅读全文