queue<int>q;
vector<int>edge[n];
for(int i=0;i<n;i++)
if(in[i]==0) q.push(i);
vector<int>ans;
while(!q.empty())
{
int p=q.front(); q.pop();
ans.push_bac...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《拓扑排序》 | 544字 | 1.6分钟 | 100% | 222 CPM | 55 次 | 0 | 优秀，成绩不错哦！ |
|
Suggestion:
可能对按键不够熟悉，或者对输入法不够熟练所导致，不要急慢慢来，先打对把准确率提高，然后逐渐的加快速度，最后才能打准打快。
|
|||||||
| Inspirational quotes: 不要见一个爱一个，爱的太多，你的爱就要贬值。 ——韩寒 | |||||||
| What do you think of this article? Give it a rating and let it serve as a guiding light for others | |||||||
Registration with the Ministry of Industry and Information Technology: Min ICP No. 19000005