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篇）

HCW 19 Team Round (ICPC format) B. Beggin' For A Node（树的重心，交互题）

B. Beggin' For A Node time limit per test2.0 s memory limit per test256 MB inputstandard input outputstandard output This is an interactive problem L...

2019-08-20

0 446

HCW 19 Team Round (ICPC format) B. Beggin' For A Node（树的重心，交互题）

B. Beggin' For A Node time limit per test2.0 s memory limit per test256 MB inputstandard input outputstandard output This is an interactive problem L...

2019-08-20

0 361

Balancing Act POJ - 1655 （树的重心）

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more t...

2019-08-19

0 466

Balancing Act POJ - 1655 （树的重心）

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more t...

2019-08-19

0 288

2019 年百度之星·程序设计大赛 - 初赛一Game HDU 6669 (实现，贪心)

Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 833 Accepted Submission(s): 200 Problem De...

2019-08-18

0 454

2019 年百度之星·程序设计大赛 - 初赛一Game HDU 6669 (实现，贪心)

Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 833 Accepted Submission(s): 200 Problem De...

2019-08-18

0 365

Lucky HDU - 5213 （莫队，容斥）

WLD is always very lucky.His secret is a lucky number . is a fixed odd number. Now he meets a stranger with numbers:.The stranger asks him questions.E...

2019-08-16

0 354

Lucky HDU - 5213 （莫队，容斥）

WLD is always very lucky.His secret is a lucky number . is a fixed odd number. Now he meets a stranger with numbers:.The stranger asks him questions.E...

2019-08-16

0 298

Powerful array CodeForces - 86D （莫队算法）

An array of positive integers a1, a2, ..., an is given. Let us consider its arbitrary subarray al, al + 1..., ar, where 1 ≤ l ≤ r ≤ n. For every posit...

2019-08-16

0 740

Powerful array CodeForces - 86D （莫队算法）

An array of positive integers a1, a2, ..., an is given. Let us consider its arbitrary subarray al, al + 1..., ar, where 1 ≤ l ≤ r ≤ n. For every posit...

2019-08-16

0 291