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

Cards and Joy CodeForces - 999F （贪心+set）

There are nn players sitting at the card table. Each player has a favorite number. The favorite number of the jj-th player is fjfj. There are k⋅nk⋅n ...

2019-04-16

0 313

Reachability from the Capital CodeForces - 999E （强连通）

There are nn cities and mm roads in Berland. Each road connects a pair of cities. The roads in Berland are one-way. What is the minimum number of new...

2019-04-16

0 279

Reachability from the Capital CodeForces - 999E （强连通）

There are nn cities and mm roads in Berland. Each road connects a pair of cities. The roads in Berland are one-way. What is the minimum number of new...

2019-04-16

0 626

Kuro and Walking Route CodeForces - 979C （树上DFS）

Kuro is living in a country called Uberland, consisting of nn towns, numbered from 11to nn, and n−1n−1 bidirectional roads connecting these towns. ...

2019-04-14

0 340

Kuro and Walking Route CodeForces - 979C （树上DFS）

Kuro is living in a country called Uberland, consisting of nn towns, numbered from 11to nn, and n−1n−1 bidirectional roads connecting these towns. ...

2019-04-14

0 362

Stack Sorting CodeForces - 911E （思维+单调栈思想）

Let's suppose you have an array a, a stack s (initially empty) and an array b (also initially empty). You may perform the following operations until ...

2019-04-12

0 285

Stack Sorting CodeForces - 911E （思维+单调栈思想）

Let's suppose you have an array a, a stack s (initially empty) and an array b (also initially empty). You may perform the following operations until ...

2019-04-12

0 397

Consecutive Subsequence CodeForces - 977F （map优化DP）·

You are given an integer array of length nn. You have to choose some subsequence of this array of maximum length such that this subsequence forms a i...

2019-04-08

0 382

Consecutive Subsequence CodeForces - 977F （map优化DP）·

You are given an integer array of length nn. You have to choose some subsequence of this array of maximum length such that this subsequence forms a i...

2019-04-08

0 477

Less or Equal CodeForces - 977C （sort+细节）

You are given a sequence of integers of length nn and integer number kk. You should print any integer number xx in the range of [1;109][1;109] (i.e. 1...

2019-04-07

0 297