摘要: #include <stdio.h>#define SIZE 100int map[SIZE][SIZE];int MAX = 0x7fffffff;int N, M, i, j, k, c;int S[SIZE];int D[SIZE];int dijistra() { for (i = 0; i < N; i++) { S[i] = 0; D[i] = map[0][i]; } S[0] = 1; D[0] = 0; int min; for (i = 1; i < N; i++) { min = MAX; int k = 0; for (j = 0; j < 阅读全文
posted @ 2011-07-19 14:24 moonbay 阅读(206) 评论(0) 推荐(1)
摘要: #include <stdio.h>#include <string.h>#include <math.h>#define MAX_DAY 200#define MAX_STATUS 65536#define MAX 0x7ffffffchar course[20][105];int deadline[20], needtime[20];int dp[MAX_STATUS], curday[MAX_STATUS], last[MAX_STATUS];void pretreat(int maxstatus, int N) { int i, j, yw; mem 阅读全文
posted @ 2011-07-19 14:20 moonbay 阅读(232) 评论(0) 推荐(1)