摘要： DP问题。#include #define MAXNUM 10002int main() { int m, n; int cost[MAXNUM]; // the Cost for every school float prob[MAXNUM]; // the probality for every school float probs[MAXNUM]; // the probality for All-amount-money int i, j; while ( scanf("%d %d", &n, &m)!=EOF && (m||n)) 阅读全文

摘要： 经典DP，想了很久，开始想复杂了。#include using namespace std;#define MAXNUM 100int mymax(int a, int b) { return (a>b) ? a:b;}int main() { int case_n; int a_n, b_n; int i, j; int a[MAXNUM], b[MAXNUM]; int match[MAXNUM][MAXNUM]; int max_a2b[MAXNUM][MAXNUM], max_b2a[MAXNUM][MAXNUM]; cin >>case... 阅读全文