大桃桃 - 博客园

TZOJ 4085 Drainage Ditches(最大流)

摘要：描述 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 a 阅读全文

posted @ 2018-08-23 22:19 大桃桃阅读(128) 评论(0) 推荐(0)

TZOJ 3711 浪漫自习(最大流)

摘要：描述如今的校园谈恋爱已是习以为常，这不，去上自习也要成双成对的。现在假设某班里有N对情侣从同一寝室楼出发，到达同一个教室上自习。途中，她们可能会经过长廊、静溪等一系列的景点观光游览。但情侣们不希望在途中碰到班里的其他情侣而扫了雅兴。现在给定包括寝室、教室、以及各个景点在内共有M个场景，以及这些场景阅读全文

posted @ 2018-08-23 22:11 大桃桃阅读(244) 评论(0) 推荐(0)

TZOJ 1321 Girls and Boys(匈牙利最大独立集)

摘要：描述 the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is 阅读全文

posted @ 2018-08-23 21:53 大桃桃阅读(179) 评论(0) 推荐(0)

TZOJ 2999 Network(连通图割点数量)

摘要：描述 A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N. 阅读全文

posted @ 2018-08-23 20:40 大桃桃阅读(159) 评论(0) 推荐(0)

TZOJ 1513 Farm Tour(最小费用最大流)

摘要：描述 When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of whi 阅读全文

posted @ 2018-08-23 20:29 大桃桃阅读(162) 评论(0) 推荐(0)

TZOJ 2018 SPF(连通图割点和分成的连通块)

摘要：描述 Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis 阅读全文

posted @ 2018-08-23 20:18 大桃桃阅读(328) 评论(0) 推荐(0)

TZOJ 2722 Matrix(树状数组区间取反单点查询)

摘要：描述 Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 阅读全文

posted @ 2018-08-18 01:19 大桃桃阅读(317) 评论(0) 推荐(0)

TZOJ 2725 See you~(二维树状数组单点更新区间查询)

摘要：描述 Now I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met so many good frie 阅读全文

posted @ 2018-08-18 01:06 大桃桃阅读(266) 评论(0) 推荐(0)

TZOJ 2560 Geometric Shapes(判断多边形是否相交)

摘要：描述 While creating a customer logo, ACM uses graphical utilities to draw a picture that can later be cut into special fluorescent materials. To ensure 阅读全文

posted @ 2018-08-12 23:26 大桃桃阅读(434) 评论(0) 推荐(0)

TZOJ 3244 Happy YuYu's Birthday(数学几何)

摘要：描述 9月10日教师节，也是YuYu的生日，妈妈给YuYu准备了一个很大的圆形蛋糕，YuYu看中了蛋糕中间那诱人的樱桃（都挤到一块啦），小家伙很高兴，心里开始盘算着如何将樱桃全部分给自己。YuYu是个“孝顺”的孩子，汗~~，每次自己不喜欢吃的都是很客气的多分点给爸妈吃，而且一定要事先尝一下（生怕爸妈阅读全文

posted @ 2018-08-12 23:10 大桃桃阅读(350) 评论(0) 推荐(0)

TZOJ 1210 The area(微积分)

摘要：描述 Ignatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and a straight line. The pictu 阅读全文

posted @ 2018-08-12 22:47 大桃桃阅读(218) 评论(0) 推荐(0)

TZOJ 3295 括号序列(区间DP)

摘要：描述给定一串字符串，只由 “[”、“]” 、“(”、“)”四个字符构成。现在让你尽量少的添加括号，得到一个规则的序列。例如：“()”、“[]”、“(())”、“([])”、“()[]”、“()[()]”，都是规则的序列。这几个不是规则的，如：“(”、“[”、“]”、“)(”、“([()”。给定阅读全文

posted @ 2018-08-12 22:27 大桃桃阅读(267) 评论(0) 推荐(0)

TZOJ 3315 买火车票(线段树区间最小值)

摘要：描述 Byteotian州铁道部决定赶上时代，为此他们引进了城市联网。假设城市联网顺次连接着n 个市从1 到n 编号(起始城市编号为1，终止城市编号为n)。每辆火车有m个座位且在任何两个运送更多的乘客是不允许的。电脑系统将收到连续的预订请求并决定是否满足他们的请求。当火车在请求的路段上有足够的空位时阅读全文

posted @ 2018-08-12 20:44 大桃桃阅读(496) 评论(0) 推荐(0)

CodeForces - 873B Balanced Substring(思维)

摘要： inputstandard input outputstandard output You are given a string s consisting only of characters 0 and 1. A substring [l, r] of s is a string slsl + 1 阅读全文

posted @ 2018-08-05 00:33 大桃桃阅读(178) 评论(0) 推荐(0)

洛谷 P1342 请柬(SPFA)

摘要：题目描述在电视时代,没有多少人观看戏剧表演。Malidinesia古董喜剧演员意识到这一事实，他们想宣传剧院,尤其是古色古香的喜剧片。他们已经打印请帖和所有必要的信息和计划。许多学生被雇来分发这些请柬。每个学生志愿者被指定一个确切的公共汽车站，他或她将留在那里一整天,邀请人们参与。这里的公交系统阅读全文

posted @ 2018-07-30 02:03 大桃桃阅读(188) 评论(0) 推荐(0)