摘要: #Codeforces Global Round 15 ##A. Subsequence Permutation 签到 思路 字符串排个序,然后匹配就行了 code: const int N = 200100; int st[30]; void solve(){ int n; string str; 阅读全文
posted @ 2021-07-28 08:56 darker_wxl 阅读(52) 评论(0) 推荐(0)
window.onload = function(){ $("#live2dcanvas").attr("style","position: fixed; opacity: 0.7; left: 70px; bottom: 0px; z-index: 1; pointer-events: none;") }