唐宋元明清201712151935887
唐宋元明清201712151935887
全部文章
未归档
dp(15)
h(10)
kmp(1)
二分(4)
匹配(1)
图论(45)
大水题~~(7)
数据结构(3)
杂乱的一坨(2)
树形结构(10)
简单搜索(6)
题解(1)
高精度(1)
归档
标签
去牛客网
登录
/
注册
欢迎来到~柳予欣的三味书屋
全部文章
/ 未归档
(共123篇)
2017 CCPC网络赛 A Secret
Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret and ask VS how to...
2018-08-16
0
432
HDU - 6383 p1m2 百度之星(二分)
度度熊很喜欢数组!! 我们称一个整数数组为稳定的,若且唯若其同时符合以下两个条件: 1. 数组里面的元素都是非负整数。 2. 数组里面最大的元素跟最小的元素的差值不超过 11。 举例而言,[1,2,1,2][1,2,1,2] 是稳定的,而 [−1,0,−1][−1,0,−1] 跟 [1,2,...
2018-08-13
0
500
HDU - 6351 Beautiful Now (暴力dfs枚举)
Anton has a positive integer nn, however, it quite looks like a mess, so he wants to make it beautiful after kk swaps of digits. Let the decimal repr...
2018-08-12
0
483
HDU - 3081 Marriage Match II (最大流+二分+并查集+(*你*别忘了别再建重边了))
Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing house we used to ...
2018-08-10
0
487
UVA - 10480 Sabotage 最大流最小割+ 输出割边集
因为是pdf形式我就不把题目弄上来了,就写主要需要注意的两点: 1.输出割边集。正确的写法是先按照源点开始dfs,如果某一边得剩余流量大于0就继续向下探索另一个点并标记,等于零就跳过这一边。最后把所有的边找出来,看看如果有两个点标记不一样(一个标记了一个没标记),就输出这个边就好了(因为我们建...
2018-08-09
0
609
HDU - 4289 Control(拆点+网络流||最小割)
Control Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4578 Accepted Submiss...
2018-08-09
0
451
HDU - 4280 Island Transport (双向图中最大流)
In the vast waters far far away, there are many islands. People are living on the islands, and all the transport among the islands relies on the ships...
2018-08-08
0
396
POJ - 2516 Minimum Cost (最小费用最大流)
Minimum Cost Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 18305 Accepted: 6465 Descriptio...
2018-08-08
0
462
最小费用最大流的模板spfa
#include<iostream> #include<cstdio> #include<queue> #include<algorithm> using namespace std; const int maxn = 100005; const in...
2018-08-08
0
407
POJ - 3436 ACM Computer Factory (拆点+网络流)
ACM Computer Factory Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9241 Accepted: 3412 ...
2018-08-08
0
502
首页
上一页
1
2
3
4
5
6
7
8
9
10
下一页
末页