- 博客(2)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 HUST - 1616 给出字符串，求[l,r]内最大的子序列的hash值
You've got string S and m queries. Each query asks you to calculate the hash value for the lexicographically maximum subsequence of substring S[l….r]. We'll call a non-empty string S[ p1p2... pk] =
2017-04-02 19:03:17
679
1
原创 HUST - 1608 求带权有向图上的最长路
If you have a date with a pretty girl in a hurry, you can ignore what I will say next. Hellis is a little bad guy in Rural Small Technical College. And the most important fact is that he is espe
2017-04-02 18:59:37
752
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人