- #include#include#include#define N 99999999using namespace std;
- int n,
- c,
- r;
- int Map[1005][1005];
- void floyd() {
- int i,
- j,
- k;
- for (k = 1; k <= n; k++) {
- for (i = 1; i <= n; i++) {
- for (j = 1; j <= n; j++) {
- if (Map[i][j] > Map[i][k] + Map[k][j]) Map[i][j] = Map[i][k] + Map[k][j];
- }
- }
- }
- }
- int main() {
- mapma;
- int cas = 1;
- char s1[1005],
- s2[1005],
- str[1005][1005];
- char from,
- to;
- int i,
- j;
- int value;
- while (scanf("%d%d%d", &n, &c, &r) && (n + c + r)) {
- ma.clear();
- for (i = 0; i <= n; i++) {
- for (j = 0; j <= n; j++) Map[i][j] = N;
- }
- int l = 1;
- for (i = 0; i <= c; i++) {
- scanf("%s", str[i]);
- if (!ma[str[i]]) ma[str[i]] = l++; //先把车库和旧车的映射 } while(r--){ scanf("%s %c-%d-%c %s",s1,&from,&value,&to,s2); if(!ma[s1])//判断有没有被映射过 ma[s1]=l++; if(!ma[s2]) ma[s2]=l++; int x=ma[s1]; int y=ma[s2]; if(from=='<' && value' && value
来源: http://www.92to.com/bangong/2017/04-11/20296594.html