摘要： hdu 1890 Robotic Sort http://acm.hdu.edu.cn/showproblem.php?pid=1890 2012-12-7区间反转View Code 1 #include <cstdio> 2 #include <algorithm> 3 using namespace std; 4 5 const int N=100010; 6 int num[N],rnk[N],pos[N]; 7 bool cmp(int a,int b) 8 { 9 return num[a]<num[b] || (num[a]==num[b] & 阅读全文