摘要： //《算法》P103 1 template <typename Type> 2 void greedySelector(int n, Type s[], Type f[], bool A[]) 3 { 4 A[1] = true; 5 int j = 1; 6 for(int i = 2; i <= n; ++ i){ 7 if(f[j] <= s[i]){ 8 A[i] = true; 9 j = i;10 }11 else12 A[i] = fal... 阅读全文

摘要： 1 #include <iostream> 2 #include <cstdlib> 3 #include<cstring> 4 using namespace std; 5 6 int max(int a, int b) 7 { 8 return (a >= b)? a : b; 9 }10 11 int min(int a, int b)12 {13 return (a < b)? a : b;14 }15 16 void knapsack(int v[], int w[], int c, int n, int m[][20])17 {18 阅读全文

摘要： 《算法》P49 1 #include <stdio.h> 2 #include <stdlib.h> 3 #include<string.h> 4 //int m[102][102], s[102][102]; 5 void MatrixChain(int *p, int n, int m[][102], int s[][102]) 6 { 7 for(int i = 1; i <= n; i ++) 8 m[i][i] = 0; 9 for(int r = 2; r <= n; r ++){10 for(int i = 1; i <= n 阅读全文