poj2104分析和总结分析和总结.docx

13-6poj2104 难度 4 K-th Number Description You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quickly k-th order statistics in the array segment. That is, given an array a[1...n] of different integer numbers, your program must answer a series of questions Q(i, j, k) in the form: What would be the k-th number in a[i...j] segment, if this segment was sorted? For example, consider the array a = (1, 5, 2, 6, 3, 7, 4). Let the question be Q(2, 5, 3). The segment a[2...5] is (5, 2, 6, 3). If we sort this segment, we get (2, 3, 5, 6), the third number is 5, and therefore the answer to the question is 5. Input The first line of the input file contains n --- the size of the array, and m --- the number of questions to answer (1 = n = 100 000, 1 = m = 5 000). The second line contains n different integer numbers not exceeding 109 by their absolute values --- the array for which the answers should be given. The following m lines contain question descriptions, each description consists of three numbers: i, j, and k (1 = i = j = n, 1 = k = j - i + 1) and represents the question Q(i, j, k). Output For each question output the answer to it --- the k-th number in sorted a[i...j] segment. Sample Input 7 3 1 5 2 6 3 7 4 2 5 3 4 4 1 1 7 3 Sample Output 5 6 3 原理：考虑到时间问题，定义变量时使用了结构体类型，其中结构体类型中定义了两个变量val（值）和 pos（位置），所以排序时只要用一次快速排序就可以了，快速排序中将 val 的值进行排序，而不改变pos 的值，然后通过搜索位置（pos）找到对应的值(val). 源 代 码 ： #includestdio.h struct data { int pos,val; } w[100000]; int main() { void quicksort(struct data w[],long int l,long int r); long int n,m,i,k,cnt,a,b,p; scanf(%d %d,n,m); for(i=1;i=n;i++) { scanf(%d,w[i].val); w[i].pos=i; //函数声明 //赋值 } quicksort(w,1,n); for(i=1;i=m;i++) {  //进行快排 scanf(%d%d%d,a,b,k); cnt=0; for(p=1;p=n;p++) if(a=w[p].posw[p].pos=b) {  //查找位置 cnt++; if(cnt==k) break; } } return 0; } printf(%d\n,w[p].val); void quicksort(struct data w[],lo