【动态规划】poj 1857 To Europe! To Europe!

#include <iostream>
#include <iomanip>
using namespace std;

int main() {
int weight,  num;
double len;
int w[10010], v[10010];
double res[10010];
while (cin >> weight >> len >> num) {
len = len * 60;
if (weight == 0 && len == 0 && num == 0) break;
for (int i = 1; i <= num; i++) {
cin >> w[i] >> v[i];
}
double sum = 0;
res[0] = 0.0;
for (int i = 1; i <= num; i++) {
int minnum = v[i];
int loadnum = w[i];
res[i] = 1.0*len / v[i] + res[i - 1];
for (int j = i-1; j >= 1; j--) {
if (loadnum + w[j] > weight) break;
else {
loadnum += w[j];
if (v[j] < minnum)
minnum = v[j];
if (res[i] > res[j - 1] + 1.0* len / minnum) {
res[i] = res[j - 1] + 1.0* len / minnum;
}
}
}
}
cout << fixed << setprecision(1) << res[num] << endl;
}
//system("pause");
return 0;
}