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)

/ 注册

全部文章（共733篇）

2015多校联合第三场5319painter

看到这个题想到之前周赛做过两遍的同样是粉刷的那个题==套啊套，依旧没找对方法示例都不对主要原因是这个题是斜着的orz有些点不出现在交线上怎么办？题解告诉我我又读错题了……你什么时候能细心点？？？ \是红色 /是蓝色而且是矩形不是正方形！能不能长点心？？？方法跟粉刷一点都不一...

2015-09-02

0 378

2015多校联合第三场 hdu5317 RGCDQ

Problem Description Mr. Hdu is interested in Greatest Common Divisor (GCD). He wants to find more and more interesting things about GCD. Today He...

2015-09-02

0 386

2015多校联合第二场5308I Wanna Become A 24-Point Master

Problem Description Recently Rikka falls in love with an old but interesting game -- 24 points. She wants to become a master of this game, so she...

hdu 算法多校

2015-09-01

0 520

2015多校联合第二场 5305 friends 深搜

Problem Description There are n people and m pairs of friends. For every pair of friends, they can choose to become online friends (commu...

2015-09-01

0 379

2015多校联合第一场5289Assignment RMQ+二分

题意：（看英文真费劲==）给定一数列求子区间能够满足其中最大值-最小值差<k 之前拿到题就想到线段树确实数据小点儿能做搜到了特别优雅的RMQ算法*^_^* 此算法用于求固定区间的最值本质是动态规划和枚举（一）首先是预处理，用动态规划（DP）解决。设A[i]是要...

多校 hdu 算法

2015-09-01

0 826

2015多校联合第一场hdu5288OO’s Sequence

链接‘ 开始有所没读明白题orz 一上午终于看懂了已知n个数相对顺序固定如果存在子区间使得任意a[i]不能整除区间里的其他数区间长度之和是多少？借用网友的思路：每个a[i]所在范围有左右顶点分别是l[i]和r[i] 则题目转化为求(i-l[i]+1)*(r[i] - i + 1) ...

hdu 多校

2015-09-01

0 537

HDU 1026 Ignatius and the Princess I 广搜

Description The Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into ...

hdu 算法广搜

2015-08-31

0 442

hdu54235423 Rikka with Tree

Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. T...

思维题 bestcoder hdu 算法

2015-08-29

0 542

hdu5422#53-div2-1Rikka with Graph

Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. T...

hdu 思维题 bestcoder

2015-08-29

0 495

ZOJ 3430 Detect the Virus ac自动机超级精简的转化

Description One day, Nobita found that his computer is extremely slow. After several hours' work, he finally found that it was a virus that made...

2015-08-29

0 500