Miss.Zhou
Miss.Zhou
全部文章
分类
###基本算法(~ o ~)Y(1)
.net(1)
2014多校联合(2)
acm(12)
arcgis(1)
bfs(1)
c#(1)
c++(1)
CF(2)
codeforces(5)
css(1)
dp(27)
git使用(1)
hdu(27)
java(1)
javascript(4)
LeetCode(47)
leetcode (1)
lightoj(1)
oi(1)
php(12)
poj(13)
poj 搜索 算法 acm(1)
poj 算法 线段树 懒惰标记(1)
python(2)
RMQ(1)
socket(1)
splay(1)
tarjan(3)
trie(3)
vmware(1)
web开发(1)
xml(1)
—dp(9)
—STL(2)
———哈希表(2)
———网络流(1)
—二分(2)
—图论(7)
—字符串(4)
—思维题(1)
—搜索(7)
—数据结构(5)
—数论(9)
—贪心(4)
三分(1)
二分图(3)
前端(1)
动态规划(1)
匈牙利算法(1)
博弈(1)
压缩(1)
双连通分量(1)
图论(4)
多校(2)
并查集(1)
并查集 poj(1)
并查集 几何 hdu(1)
并查集 算法(2)
广搜(2)
思维题(1)
拓扑排序(1)
搜素(1)
搜索(1)
操作系统(2)
数据结构(1)
数论 算法(3)
最佳二分匹配(1)
最大二分匹配(2)
最小树形图(1)
未归档(397)
杭电(7)
树型dp(2)
模拟(1)
欧拉回路(1)
正则表达式(1)
深搜(1)
深搜 hdu 算法(1)
矩阵(1)
算法(10)
算法 并查集(1)
线段树(6)
编程(1)
网络流(4)
计算机基础(4)
设计模式(19)
贪心(1)
随笔(1)
题解(8)
验证码(1)
归档
标签
去牛客网
登录
/
注册
MissZhou的小窝
六年磨一剑~
全部文章
(共32篇)
poj3370Halloween treats抽屉原理
链接 简单的说就是已知c,n和n个无序数字,要求这n个数中那些的和能被c整除== 联想到课件给的 例题: POJ 2356 题意: 给定n个数,求其中的任意一个非空子集满足集合中的每个元素值加和正好是n的倍数 。 分析: ...
数论 算法
poj
2015-08-03
0
600
POJ 2513 Colored Sticks 欧拉回路+trie树
题目 Description You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to ali...
poj
欧拉回路
算法
trie树
2015-08-20
0
536
poj3667hotal线段树【经典】
这个题又是把懒惰标记和动作状态混在一起了==还有push-up push-down 背了吧。。。 好怕怕…… 注意1和L! #include <iostream> #include<cstring> #include<cstdio> using nam...
线段树
poj
2015-08-10
0
565
poj1113Wall凸包入门题 模板
Description Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. The King was so gre...
poj
凸包
2015-09-11
0
597
POJ 1386 Play on Words 欧拉回路
Description Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Becaus...
欧拉回路
poj
算法
2015-08-20
0
593
POJ 2240 Arbitrage floyd
Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the sa...
poj
算法
floyd
2015-08-21
0
673
POJ 1860 Currency Exchange spfa
Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and ...
poj
算法
spfa
2015-08-21
0
670
POJ 2771 Guardian of Decency最大独立集
Description Frank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excursion, but he is afr...
最大二分匹配
poj
算法
2015-08-23
0
611
POJ 2195 Going Home(二分图最大权值匹配) KM
Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either ...
poj
最佳二分匹配
算法
2015-08-23
0
500
poj2096Collecting Bugs【概率DP】
Description Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. Whe...
poj
dp
2015-10-12
0
583
首页
上一页
1
2
3
4
下一页
末页