小小西北风

题目链接：【POJ 2367】 将n（n>=1 &&n in[i]=x表示有x个人在i的前面，link[i][j]=1表示ij有先后关系，每次都将in[i]=0的放到队列中去 #include #include #include #include #include #include using namespace std; int n, len, m; int in[110],

C. Journey time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Recently Irina arrived to one of the most famous