vocaloid01的博客

时间复杂度：预处理O(nlogn)，查询O(1)。  const int MAXN = ; int board[MAXN];//存数据下标从1开始 int ma[MAXN][20],mi[MAXN][20];//区间最大值，区间最小值。 void ST_prework(int n){ for(int i=1 ; i<=n ; ++i)ma[i][0] = mi[i][0] = ...

Tom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has a ability. Now, Tom is going to assign a special task to some staffs who w...