弓长九日

未归档

CDQ(1) codeforces(1) DP(9) SSM框架(3) 《算法竞赛进阶指南》杂谈(14) 二分(1) 分块(1) 动态规划(1) 图论(11) 基本算法(5) 字符串(6) 差分(2) 并查集(2) 思维(18) 搜索(7) 数学(16) 数据结构(17) 树型结构(4) 树套数(1) 模拟(2) 爬虫(6) 系统配置记录(1) 线段树(8) 计算机网络(2) 贪心(2) 面试(3) 题解(4) 题集(45)

/ 注册

全部文章 / 未归档（共127篇）

[最大生成树 kruskal&&优先队列prim] Save your cats Aizu - 2224&& Bad Cowtractors POJ - 2377

Save your cats Aizu - 2224 Nicholas Y. Alford was a cat lover. He had a garden in a village and kept many cats in his garden. The cats were so cute t...

2018-07-27

0 471

[最大生成树 kruskal&&优先队列prim] Save your cats Aizu - 2224&& Bad Cowtractors POJ - 2377

Save your cats Aizu - 2224 Nicholas Y. Alford was a cat lover. He had a garden in a village and kept many cats in his garden. The cats were so cute t...

2018-07-27

0 394

[逆元]The Wall (medium) CodeForces - 690D2 && Sum HDU - 4704

费马小定理题一 #include <cstdio> #include <iostream> #include <algorithm> #include <cstring> using namespace std; typedef long lon...

2018-07-24

0 411

[逆元]The Wall (medium) CodeForces - 690D2 && Sum HDU - 4704

费马小定理题一 #include <cstdio> #include <iostream> #include <algorithm> #include <cstring> using namespace std; typedef long lon...

2018-07-24

0 436

[DFS找环]New Reform CodeForces - 659E

Berland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one r...

2018-07-23

0 432

[DFS找环]New Reform CodeForces - 659E

Berland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one r...

2018-07-23

0 683

【BFS】Ball Aizu - 0033 原题正解 DFS

RT ORZ 硬生生写成bfs #include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <stack> #includ...

2018-06-03

0 477