风吹奶子摆

摘要： void quicksort(int * a, int l, int r){ if (l key) { high --; } a[low] = a[high]; while (low < high && a[low] < key) { low ++; } a[high] = a[low]; quicksort(a, l, low - 1); ... 阅读全文

摘要： #include #include #include #include using namespace std;struct Data{ int daily; int zhujiao; string beijiao; int zjyys; int bjyys; int zjhk; int bjhk; int zjdq; int bjdq; string begin; string end; int length; int lei; int jizhan; Data(){}};int main(){ ... 阅读全文