- 博客(2)
- 收藏
- 关注
RSS订阅原创 2019年 ACM/ICPC 亚洲区域赛（徐州）网络赛M.Longest subsequence（思维+贪心）
String is a very useful thing and a subsequence of the same string is equally important.Now you have a stringsswith lengthnnand a stringttwith lengthmm. Find out the longest subsequence in th...
2019-09-07 20:43:10
1647
原创 2019年 ACM/ICPC 亚洲区域赛（南京）网络赛D. Robots（期望dp）
Given a directed graph with no loops which starts at node11and ends at nodenn.There is a robot who starts at11, and will go to one of adjacent nodes or stand still withequal probabilityevery d...
2019-09-01 19:52:54
555
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人