QieQiemin

分类

ACM刷题之旅(9) ACM常用知识(7) Atcoder/洛谷(83) a牛客网/comet OJ(200) codeforces(323) HDU/POJ/BZOJ/计蒜客(108) STL(2) 二分(1) 二分/三分(2) 几何（计算几何，解析几何）(7) 分治/偏序(2) 动态规划DP(18) 图的全家桶/ 最短路/Tarjan强连通/MST/拓扑(7) 字符串处理/ hash(5) 字符串的高级算法/ACM(1) 思维(5) 搜索系列/BFS/DFS(2) 数学/MATH/ 组合数学/(5) 数据结构/线段树/树状数组(12) 数论(7) 暴力/状态压缩/二进制枚举(2) 未归档(4) 构造/技巧(7) 树的全家桶/ 树形DP/ LCA/MST/树链剖分(6) 模拟/实现(2) 模板(19) 组队赛训练记录(2) 规律/打表/结论题(2) 贪心(1) 题解(1) 高精/大数(6)

/ 注册

TA的专栏 16篇文章 0人订阅

ACM训练题解报告

16篇文章 1816人学习

全部文章（共858篇）

Average Sleep Time CodeForces - 808B （前缀和）

It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days! When Polycarp wen...

2019-01-15

0 577

Average Sleep Time CodeForces - 808B （前缀和）

It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days! When Polycarp wen...

2019-01-15

0 560

牛客练习赛B题筱玛的排列（找递推规律）

链接：https://ac.nowcoder.com/acm/contest/342/B来源：牛客网筱玛的排列时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 524288K，其他语言1048576K 64bit I...

2019-01-15

0 1954

牛客练习赛B题筱玛的排列（找递推规律）

链接：https://ac.nowcoder.com/acm/contest/342/B来源：牛客网筱玛的排列时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 524288K，其他语言1048576K 64bit I...

2019-01-15

0 370

牛客练习赛 A题筱玛的快乐

链接：https://ac.nowcoder.com/acm/contest/342/A来源：牛客网筱玛的快乐时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 524288K，其他语言1048576K 64bit I...

2019-01-15

0 491

牛客练习赛 A题筱玛的快乐

链接：https://ac.nowcoder.com/acm/contest/342/A来源：牛客网筱玛的快乐时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 524288K，其他语言1048576K 64bit I...

2019-01-15

0 505

Success Rate CodeForces - 807C （数学+二分）

You are an experienced Codeforces user. Today you found out that during your activity on Codeforces you have made y submissions, out of which x have b...

2019-01-15

0 517

Success Rate CodeForces - 807C （数学+二分）

You are an experienced Codeforces user. Today you found out that during your activity on Codeforces you have made y submissions, out of which x have b...

2019-01-15

0 404

Division and Union CodeForces - 1101C （排序后处理）

There are nn segments [li,ri][li,ri] for 1≤i≤n1≤i≤n. You should divide all segments into two non-empty groups in such way that there is no pair of seg...

2019-01-12

0 416

Division and Union CodeForces - 1101C （排序后处理）

There are nn segments [li,ri][li,ri] for 1≤i≤n1≤i≤n. You should divide all segments into two non-empty groups in such way that there is no pair of seg...

2019-01-12

0 350