题目意思是说 给你一个数k 然后有k个si 问你1--k 的第n个全排列是多少 注意是 1 2 3...k的全排列 不是si的

N= <??http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vcD4KPHA+08m527LstcPWqihrLWkpIb7NysdrLWm49sr919a1xMirxcXB0NbWyv2jrCAwPTxTaTw9ay1po6zL+dLUz9TIu7/J1qq82cnotbFpPT0xyrG007XaKGstMSkhKnMxtb212m649sirxcXB0La8ysfTybXaUzEmIzQzOzG49sr919a/qsq8tcTK/cHQo6zS8s6qw78oay0xKSG0zsXFwdC5/brzo6zPwtK7uPbFxcHQtcS12jG49sr919a2vNKq1Pa08zGjqMO/uPQoay0xKSG0zqOs1eJrLTG49sr919a2vMXFwdC5/dK7senBy6Osz8LSu7TO1rvE3NT2tPO4/Meww+bSu7j2o6zSsr7Nyse12jG49sHLKTwvcD4KPHA+PC9wPgo8cD6xyMjnttTT2sr9wdB7MSwyLDMsNH2jrLzZyehTMT0yo6y1sWk9PTG1xMqxuvK21NPaMiooNC0xKSGjrLTTMLW9KDQtMSkhxcXB0NK7tqjKxzEseCx4LHijrLTTMSooNC0xKSG1vTIqKDQtMSkhxcXB0NK7tqjKxzIseCx4LHijrLTTMiooNC0xKSG1vTMqKDQtMSkhtcTFxcHQ0ru2qMrHMyx4LHgseMv50tTO0sPHvs3WqrXAwctTMbXI09oytcS7sKOstdrSu7j2yv3X1tK7tqjKxzOjrNXi0fnO0sPHvs28xsvjs/bBy7Xa0rvK/dfWoaOho7y0ztLDx8i3tqjV4rj2yv3B0NK7tqjKxzMseCx4LHg8L3A+CjxwPsv50tTV4tH5ztLDx82ouf1TMb/J0tS8xsvjs/a12tK7uPbK/dfWo6xTMrzGy+Oz9rXatv649sr919bWsbW9x/Oz9r3hufuho6GjvPK1pbXEy7W+zcrH08lTMc7Sw8fU2tXiS7j2yv3X1tbQ1dK1vbXaUzEmIzQzOzG087XEyv3X1rfF1Nq12tK7zrujrMi7uvPTw8qjz8K1xEstMbj2yv3X1silxcXB0Mqjz8K1xMirxcXB0KOszazR+bXE1NrV4sqjz8K1xEstMbj2yv3X1tbQ1dK1vbXaUzImIzQzOzG087XEyv3X1rfF1NrX7seww+Y8L3A+CjxwPsi7uvO+zdPDyvfXtMr91+nH87XaU2kmIzQzOzG088CyfiDV4rj2vs2yu8+4y7XByzwvcD4KPHA+ICAgPC9wPgpjb2RlKLHIvc+z88Kqo6yyu9KqvenS4n4po7oKPHA+PHByZSBjbGFzcz0="brush:java;">#include #include #include #include #include #define ufor(a,b,c) for(int a=b;a c;a--) #define LL long long #define clr(arr,val) memset(arr,val,sizeof(arr)) using namespace std; const int maxn=50005; int a[maxn]; int c[maxn]; int k; int lowbit(int x) { return x&(-x); } void add(int x,int val) { while(x<=k) { c[x]+=val; x+=lowbit(x); } } int sum(int x) { int num=0,ans=0; dfor(i,16,-1) { num+=(1< =k || c[num]+ans >= x) num-=(1< >t; while(t--) { cin>>k; clr(c,0); ufor(i,1,k+1) add(i,1); int tmp; ufor(i,0,k) { cin>>tmp; tmp++; int ans=sum(tmp); cout<