怎么用计算机算法向量,【计算机网络】距离向量算法（D-V）

#includeusing namespace std;

const int maxn = 1e3+10;

struct Node

{

string name;

int len;

char s;

}b[maxn], c[maxn];

bool cmp(const Node &a,const Node &b)

{

return a.name < b.name;

}

int main()

{

int m, n;

cin >> m >> n;

int i, j;

for(i = 0; i < m; i++)

{

cin >> b[i].name;

cin >> b[i].len;

cin >> b[i].s;

}

for(i = 0; i < n; i++)

{

cin >> c[i].name;

cin >> c[i].len;

cin >> c[i].s;

c[i].len += 1;

c[i].s = 'C';

}

for(i = 0; i < n; i++)

{

for(j = 0; j < m; j++)

{

if(c[i].name == b[j].name)

{

if(c[i].s != b[j].s && c[i].len < b[j].len)

{

b[j].len = c[i].len;

b[j].s = c[i].s;

}

else if(c[i].s == b[j].s)

{

b[j].len = c[i].len;

b[j].s = c[i].s;

}

break;

}

else if(c[i].name != b[j].name && (j == m-1))

{

b[m].name = c[i].name;

b[m].len = c[i].len;

b[m].s = c[i].s;

m += 1;

break;

}

}

}

//cout << m << endl;

sort(b, b+m, cmp);

for(i = 0; i < m; i++)

{

cout << b[i].name << " " << b[i].len << " " << b[i].s << endl;

}

return 0;

}