- 博客(2)
- 收藏
- 关注
原创 Codeforces 919D - Substring 【有向图判环+DP】
Codeforces 919D - Substring 【有向图判环+DP】You are given agraph with n nodes and m directed edges. One lowercase letter is assigned to each node. We define a path'svalue as the number of the most frequently occurring letter. For example, ifletters on a path ar
2018-01-31 23:18:49 894
原创 Codeforces 913D - Too Easy Problems 【优先队列】
Codeforces 913D - Too Easy Problems 【优先队列】You are preparing for an exam onscheduling theory. The exam will last for exactly T millisecondsand will consist of n problems. You can either solve problem i in exactly ti milliseconds orignore it and spend no ti
2018-01-09 09:49:25 814
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人