UVa 11242

題目：變速自行車有兩個齒輪盤，每個盤上有幾個齒輪，變速級別是變速比的有序序列；

            求變速序列中相鄰比例的最大值。

分析：排序。存儲所有的變速比例，排序統計即可。

說明：( ⊙ o ⊙ )！

#include <stdio.h>#include <stdlib.h>double F[11];double R[111];double D[1111];int cmp(const void *a, const void *b){if (*(double *)a < *(double *)b) {return -1;}else {return 1;}}int main(){int f, r;while (~scanf("%d",&f) && f) {scanf("%d",&r);for (int i = 0; i < f; ++ i) {scanf("%lf",&F[i]);}for (int i = 0; i < r; ++ i) {scanf("%lf",&R[i]);}int count = 0;for (int i = 0; i < f; ++ i) {for (int j = 0; j < r; ++ j) {D[count ++] = F[i]/R[j];}}qsort(D, count, sizeof(double), cmp);double ans = 0;for (int i = 1; i < count; ++ i) {if (ans < D[i]/D[i-1]) {ans = D[i]/D[i-1];}}printf("%.2lf\n",ans);}return 0;}