自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(11)
  • 收藏
  • 关注

原创 Git命令(二)

1、gitbranch <branchname> :创建新的分支2、gitcheckout <branchname> :切换分支3、git log --oneline --decorate --graph --all :查看项目的分支历史,图的形式...

2020-03-13 18:36:37 236

原创 Git命令(一)

注:使用--global该命令只会使用一次1、git config --list --show-origin :查看所有的配置以及它们所在的文件2、git config --global user.name "**" :设置用户名3、git config --global user.email **@qq.com :设置邮箱4、git config --global core.ed...

2020-03-09 11:58:14 287

原创 hdu6299,hdu多校第一场

Balanced Sequence   Problem Description Chiaki has n strings s1,s2,…,sn consisting of '(' and ')'. A string of this type is said to be balanced: + if it is the empty string + if A...

2018-07-24 14:15:33 322

原创 牛客网暑期ACM多校训练营(第一场)D.Two Graphs

链接:https://www.nowcoder.com/acm/contest/139/D来源:牛客网 题目描述Two undirected simple graphs and where are isomorphic when there exists a bijection on V satisfying  if and only if {x, y} ∈ E2.Given...

2018-07-20 14:11:11 185

原创 PIGS POJ - 1149 (最大流SAP算法)

Mirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys...

2018-04-25 20:13:02 252

原创 Silver Cow Party POJ - 3268(dij)

One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M≤ 100,000) unidirectional (one-way roa...

2018-04-21 17:50:23 166

原创 Drainage Ditches POJ - 1273 (入门网络流最大流 EK算法)

Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Fa...

2018-04-20 22:37:46 197

原创 HDU:6060 RXD and dividing (DFS)

RXD has a tree TT, with the size of nn. Each edge has a cost. Define f(S)f(S) as the the cost of the minimal Steiner Tree of the set SS on tree TT. he wants to divide 2,3,4,5,6,…n2,3,4,5,6,…n into kk ...

2018-04-19 21:46:59 195

原创 Til the Cows Come Home POJ - 2387 最短路,dij+优先队列

Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get b...

2018-04-11 21:40:44 232

原创 Codeforces Round #467 (Div. 2)E. Lock Puzzle

点击打开链接题意:给定两个一样长的字符串s,t,长度n&lt;=2000,问你能否在6100步操作内使s变成t,操作是每次将s的末尾子串反转然后补充到前面,就如«bcacab », since α = ab, β = cacb, βR = bcac.,则变成bcacab;,如果可以输出每次变换的尾串长度,否则输出-1;思路:每次从s中寻找一个字符满足t的末尾往前走,然后将找到的字符往前面顶,并且保...

2018-04-09 22:35:39 152

原创 Codeforces Round #464 (Div. 2)E. Maximize!

题目题意:两种操作:1,代表输入一个数,每次输入的数不小于前面输入的数;2,代表输出max(s)-mex(s),在数组中找出子集,使子集的最大值减去子集平均值,,求出最大的值。方法:每次必选最大值,然后从小选取求平均值,判断,因为一个数比平均值小,加进来只会使平均值变小,比平均值变大,加进来会使平均值变大,所以可以三分#include &lt;cstdio&gt;#include&lt;iost...

2018-04-09 22:19:03 165

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除