摘要: 1 inline int read(){ 2 int x=0,f=1; 3 char ch=getchar(); 4 while(ch'9'){ 5 if(ch=='-') 6 f=-1; 7 ch=getchar(); 8 } 9 while(ch>='0'&&ch<='9'){ ... 阅读全文
posted @ 2019-09-19 20:41 Cherlie 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 时间限制(普通/Java):1000MS/3000MS 内存限制:65536KByte 描述 In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each query (L, 阅读全文
posted @ 2019-09-19 20:14 Cherlie 阅读(180) 评论(0) 推荐(0) 编辑