QieQiemin

codeforces

ACM刷题之旅(9) ACM常用知识(7) Atcoder/洛谷(83) a牛客网/comet OJ(200) 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)

/ 注册

全部文章 / codeforces （共323篇）

C - Covered Points Count CodeForces - 1000C （差分，离散化，统计）

C - Covered Points Count CodeForces - 1000C You are given nn segments on a coordinate line; each endpoint of every segment has integer coordinates....

2019-09-12

0 0

D - Yet Another Problem On a Subsequence CodeForces - 1000D （DP，组合数学）

D - Yet Another Problem On a Subsequence CodeForces - 1000D The sequence of integers a1,a2,…,aka1,a2,…,ak is called a good array if a1=k−1a1=k−1 and...

2019-09-12

0 497

D - Yet Another Problem On a Subsequence CodeForces - 1000D （DP，组合数学）

D - Yet Another Problem On a Subsequence CodeForces - 1000D The sequence of integers a1,a2,…,aka1,a2,…,ak is called a good array if a1=k−1a1=k−1 an...

2019-09-12

0 414

E - We Need More Bosses CodeForces - 1000E （tarjan缩点，树的直径）

E - We Need More Bosses CodeForces - 1000E Your friend is developing a computer game. He has already decided how the game world should look like — ...

2019-09-12

0 503

E - We Need More Bosses CodeForces - 1000E （tarjan缩点，树的直径）

E - We Need More Bosses CodeForces - 1000E Your friend is developing a computer game. He has already decided how the game world should look like — i...

2019-09-12

0 670

F - One Occurrence CodeForces - 1000F （线段树+离线处理）

You are given an array aa consisting of nn integers, and qq queries to it. ii-th query is denoted by two integers lili and riri. For each query, you h...

2019-09-12

0 482

F - One Occurrence CodeForces - 1000F （线段树+离线处理）

You are given an array aa consisting of nn integers, and qq queries to it. ii-th query is denoted by two integers lili and riri. For each query, you h...

2019-09-12

0 585

Almost Regular Bracket Sequence CodeForces - 1095E （线段树，单点更新，区间查询维护括号序列）

Almost Regular Bracket Sequence CodeForces - 1095E You are given a bracket sequence ss consisting of nn opening '(' and closing ')' brackets. A re...

2019-09-11

0 342

Almost Regular Bracket Sequence CodeForces - 1095E （线段树，单点更新，区间查询维护括号序列）

Almost Regular Bracket Sequence CodeForces - 1095E You are given a bracket sequence ss consisting of nn opening '(' and closing ')' brackets. A reg...

2019-09-11

0 505

Sereja and Brackets CodeForces - 380C （树状数组+离线）

Sereja and Brackets 题目链接： CodeForces - 380C Sereja has a bracket sequence s1, s2, ..., s**n, or, in other words, a string s of length n, consisting...

2019-09-09

0 394