奇数单增序列（快速排序）

Posted 2021-12-18 vergica

http://noi.openjudge.cn/ch0110/02/

 #include <iostream>
 using namespace std;
 int a[500];
 
 void qsort(int l, int r) 
     int i, j, mid, p;
     i = l; j = r;
     mid = a[(l+r)/2];
     do 
         while (a[i]<mid) i++;
         while (a[j]>mid) j--;
         if (i<=j) 
             p = a[i]; a[i] = a[j]; a[j] = p;
             i++; j--;
         
      while (i<=j);
     if (l<j) qsort(l, j);
     if (i<r) qsort(i, r);
 
 
 int main() 
     int n, t, k=0;
     cin >> n;
     for (int i=0; i<n; i++) 
         cin >> t;
         if (t%2==1) a[k++] = t;
     
     qsort(0, k-1);
     for (int i=0; i<k-1; i++)
         cout << a[i] << ",";
     cout << a[k-1] << endl;
     return 0;