摘要: A. Sushi for Two 代码: #include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int N, cnt = 0; int a[maxn], vis[maxn]; int main() { sca 阅读全文
posted @ 2019-04-21 21:37 丧心病狂工科女 阅读(122) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=2222 Problem Description In the modern time, Search engine came into the life of everybody like Google, Baid 阅读全文
posted @ 2019-04-21 12:56 丧心病狂工科女 阅读(159) 评论(0) 推荐(0) 编辑
摘要: see u again 阅读全文
posted @ 2019-04-21 09:43 丧心病狂工科女 阅读(182) 评论(0) 推荐(0) 编辑