如何去“编程表达”这样的递归式？ RECURSIVE-ACTIVITY-SELECTOR (s.f.k,n) 1m=k+1 2 while m≤n and s[m<f[k] /find the first activity in Sk to finish 3 n=m+1 4 ifm≤n 5 return {am}URECURSIVE-ACTIVITY-SELECTOR(s,f.m.n) 6 else return 0 解子问题Sk+1如何去“编程表达”这样的递归式？ 解子问题Sk+1