1-6 If a connected graph G has no topological sorting sequence, then graph G must have a cycle. (1分) T F 作者 周强 单位 青岛大学 1-7 Greedy algorithm works only if the local optimum is equal to the global optimum. (1分)
1/*算法123个静态数组, 2个序列全部并入第3个序列*/3#include <stdio.h>4#defineN 10000056intmain()7{8inta1[N], a2[N], c[2*N], cnt1=0, cnt2=0, cnt=0;9intn;10scanf("%d",&n);11for(inti=0; i<n; ++i)12scanf("%d",&a1[i]);13for(inti=0; i<n; ++i)14scanf("%d",...