Skip to content

【2022寒假精进训练-8】7-11 病毒溯源 | HBUACM #27

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
HANXU2018 opened this issue Jun 18, 2022 · 0 comments
Open

【2022寒假精进训练-8】7-11 病毒溯源 | HBUACM #27

HANXU2018 opened this issue Jun 18, 2022 · 0 comments

Comments

@HANXU2018
Copy link
Member

https://hbuacm.github.io/2022/02/15/%E3%80%902022%E5%AF%92%E5%81%87%E7%B2%BE%E8%BF%9B%E8%AE%AD%E7%BB%83-8%E3%80%917-11%20%E7%97%85%E6%AF%92%E6%BA%AF%E6%BA%90/

病毒容易发生变异。某种病毒可以通过突变产生若干变异的毒株,而这些变异的病毒又可能被诱发突变产生第二代变异,如此继续不断变化。 现给定一些病毒之间的变异关系,要求你找出其中最长的一条变异链。 在此假设给出的变异都是由突变引起的,不考虑复杂的基因重组变异问题 —— 即每一种病毒都是由唯一的一种病毒突变而来,并且不存在循环变异的情况。 输入格式:输入在第一行中给出一个正整数 N(≤10^4^),即病毒种

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant