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) 杭电(7) 树型dp(2) 模拟(1) 欧拉回路(1) 正则表达式(1) 深搜(1) 深搜 hdu 算法(1) 矩阵(1) 算法(10) 算法并查集(1) 线段树(6) 编程(1) 网络流(4) 计算机基础(4) 设计模式(19) 贪心(1) 随笔(1) 题解(8) 验证码(1)

/ 注册

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

codeforcesB - Arpa’s obvious problem and Mehrdad’s terrible solution 【思维】

There are some beautiful girls in Arpa’s land as mentioned before. Once Arpa came up with an obvious problem: Given an array and a number x, cou...

2016-12-13

0 525

hdu43700 or 1【01规划模型最短路】

Description Given a n*n matrix C ij (1<=i,j<=n),We want to find a n*n matrix X ij (1<=i,j<=n),which is 0 or 1. ...

2016-10-10

0 438

hdu3488Tour【二分图最大权匹配 KM】

Description In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You ar...

2016-10-09

0 522

poj2112Optimal Milking【floyd最短路+二分图多重匹配+二分】

Description FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set...

2016-10-08

0 540

hdu1151Air Raid【最小路径覆盖】

Description Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that ...

2016-10-08

0 469

bnu52326Just Convolution弱校联盟10.5【暴力？复杂度】

https://acm.bnu.edu.cn/v3/statments/***2016.pdf 题意：给定a数组和b数组。求c数组要求c[k]=max(a[i]+b[j])其中i+j==k||i+j==k+n 做法：一直在想如何降低时间复杂度未果，看了Ac代码觉得似曾相识？？由于要凑数嘛...

2016-10-07

0 574

HDU 2819 Swap 【二分图匹配交换方法】

Description Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make al...

2016-10-04

0 485

hdu4807Lunch Time【费用流】

Lunch Time Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 617 Accepted Submission(s): 11...

2016-09-22

0 433

hdu5890Eighty seven【bitset优化01背包】

Eighty seven Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others) Total Submission(s): 583 Accepted Submission(s)...

2016-09-21

0 490

hdu5887Herbs Gathering【大数据01背包：搜索后缀+剪枝】

Problem Description Collecting one's own plants for use as herbal medicines is perhaps one of the most self-empowering things a person can do, as ...

2016-09-20

0 554