A.I'm pleased to meet you.
B.Yes, you can leave if you like.
C.Oh, no, you can't.
D.All right. Hope to see you soon.
第1题:
Kathy, I’d like you to meet Maggie Jacobs.
(). Maggie. You’re doing a great job.
A、 I‘m pleased to meet you
B、 It’s great to see you again
C、 I' m happy to meet you too
第2题:
A、call; arrive
B、will call; arrive
C、call; will arrive
D、will call; will arrive
第3题:
John: Well, it's getting late. Maybe we could get together some other time.
Harry: _________.
A、Take it easy
B、Nice to see you back
C、Sounds good
D、I'll give you a call
E、Yes,I've enjoyed it
第4题:
What can I do for you, Madam?
()500yuan in cash to my son in Beijing University.
A、 You’d better remit
B、 I'd like to remit
C、 I'd rather remit
第5题:
–– Son: Mom, may I play computer game for an hour or so?
–– Mom: ____
A: Your teacher tells me that you should study harder.
B: Sorry, Dad ’s using the computer now.
C: I ’ve said before that the game takes too long.
D: Well, ah ⋯You’re absolutely right to ask.
第6题:
B 宽度优先(种子染色法)
5.关键路径
几个定义: 顶点1为源点,n为汇点。
a. 顶点事件最早发生时间Ve[j], Ve [j] = max{ Ve [j] + w[I,j] },其中Ve (1) = 0;
b. 顶点事件最晚发生时间 Vl[j], Vl [j] = min{ Vl[j] – w[I,j] },其中 Vl(n) = Ve(n);
c. 边活动最早开始时间 Ee[I], 若边I由<j,k>表示,则Ee[I] = Ve[j];
d. 边活动最晚开始时间 El[I], 若边I由<j,k>表示,则El[I] = Vl[k] – w[j,k];
若 Ee[j] = El[j] ,则活动j为关键活动,由关键活动组成的路径为关键路径。
求解方法:
a. 从源点起topsort,判断是否有回路并计算Ve;