POJ
小蒟蒻yyb
Studnet
展开
-
【POJ3207】Ikki's Story IV - Panda's Trick
Ikki’s Story IV - Panda’s Trickliympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants原创 2017-06-30 09:05:43 · 771 阅读 · 1 评论 -
【POJ2774】Long Long Message(后缀数组)
题面VjudgeDescriptionLittle cat在Byterland的首都读物理专业。这些天他收到了一条悲伤地信息:他的母亲生病了。担心买火车票花钱太多(Byterland是一个巨大的国家,因此他坐火车回家需要16小时),他决定只给母亲发短信。 Little cat的家境并不富裕,因此他经常去营业厅查看自己发短信花了多少钱。昨天营业厅的电脑坏掉了,打印出两条很长的信息。原创 2018-01-23 14:46:10 · 238 阅读 · 0 评论 -
【POJ1743】Musical Theme(后缀数组)
题面洛谷,这题是弱化版的,O(n2)dpO(n^2)dp能过 hihoCoder 有一点点区别 POJ 多组数据题解要求的是最长不可重叠重复子串 也就是找两个最长的相同子串 使得它们不相交先求出SA,heightSA,height 考虑一下如果两个子串相同 那么也就是两个后缀的前缀相同还是一样吧。 二分答案,长度为KK 那么,现在要找的就是连续长度不小于KK的heightheight原创 2018-01-23 17:19:37 · 204 阅读 · 0 评论 -
【POJ1151】Atlantis(线段树,扫描线)
题面Vjudge题解学一学扫描线 其实很简单啦 这道题目要求的就是若干矩形的面积和把扫描线平行于某个轴扫过去(我选的平行yy轴扫) 这样只需要求出每次和xx轴覆盖的长度 就可以两两相乘,求出面积 最后累计和就行啦#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#i原创 2018-02-06 22:11:37 · 200 阅读 · 0 评论 -
【POJ1741】Tree(点分治)
题面Vjudge 题目大意: 求树中距离小于KK的点对的数量题解完全不觉得点分治了。。 简直GGGG,更别说动态点分治了。。。于是来复习一下。对于每一层分治重心 求出它到子树中任意点的距离 然后two−pointerstwo-pointers计算满足大于KK的点对的数目,累加到答案中, 但是同一棵子树内的会算重 所以再对于每一棵子树,减去字数内两两满足要求的点对 完全不记得了#inc原创 2018-04-05 21:46:57 · 182 阅读 · 0 评论 -
【POJ2976】Dropping Tests(分数规划)
题面Vjudge 翻译在VjudgeVjudgeVjudge上有(而且很皮)题解简单的010101分数规划 需要我们做的是最大化∑a[i]∑b[i]∑a[i]∑b[i]\frac{\sum a[i]}{\sum b[i]} 考虑二分答案 将最大化问题转换为判定问题 ∑a[i]−mid∑b[i]≥0∑a[i]−mid∑b[i]≥0\sum{a[i]}-mid\sum{b[i...原创 2018-05-23 16:47:07 · 345 阅读 · 0 评论 -
【POJ2728】Desert King(分数规划)
题面vjudge 翻译: 有nnn个点,每个点有一个坐标和高度 两点之间的费用是高度之差的绝对值 两点之间的距离就是欧几里得距离 求一棵生成数,使得单位距离的费用最小题解使得∑cost/∑dis∑cost/∑dis\sum cost/\sum dis最小 这是分数规划问题 二分答案KKK 如果KKK满足,则有 ∑cost−K∑dis≤0∑cost−K∑dis≤0\su...原创 2018-05-23 19:17:42 · 188 阅读 · 0 评论 -
【POJ3621】【洛谷2868】Sightseeing Cows(分数规划)
题面Vjudge 洛谷 大意: 在有向图图中选出一个环,使得这个环的点权///边权最大题解分数规划 二分答案之后把每条边的边权换为mid·mid·mid·边权-出点的点权 然后检查有没有负环就行啦#include<iostream>#include<cstdio>#include<cstdlib>#include<cst...原创 2018-05-24 15:17:29 · 193 阅读 · 0 评论 -
【POJ2891】Strange Way to Express Integers(拓展CRT)
题面Vjudge 板子题。题解拓展CRTCRTCRT模板题。#include<iostream>#include<cstdio>using namespace std;#define ll long long#define MAX 111111ll exgcd(ll a,ll b,ll &x,ll &y){ if...原创 2018-07-16 09:16:56 · 293 阅读 · 0 评论 -
POJ 3268 Silver Cow Party(最短路)
题面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 r原创 2017-07-26 23:50:54 · 360 阅读 · 0 评论 -
【POJ 3401】Asteroids
题面Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently locat原创 2017-07-24 10:01:39 · 321 阅读 · 0 评论 -
【POJ2387】Til the Cows Come Home (最短路)
题面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原创 2017-07-25 23:25:19 · 178 阅读 · 0 评论 -
【POJ3683】Priest John's Busiest Day
POJ 3683 题目John is the only priest in his town. September 1st is the John’s busiest day in a year because there is an old legend in the town that the couple who get married on that day will be forever blessed b原创 2017-07-01 08:37:03 · 2228 阅读 · 1 评论 -
【POJ3461】Oulipo
题面The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter ‘e’. He was a member of the Oulipo group. A quote from the book:Tout avait Pair normal, mais tout s’a原创 2017-07-15 22:23:35 · 428 阅读 · 0 评论 -
POJ 2187 Beauty Contest(凸包,旋转卡壳)
题面Bessie, Farmer John’s prize cow, has just won first place in a bovine beauty contest, earning the title ‘Miss Cow World’. As a result, Bessie will make a tour of N (2 <= N <= 50,000) farms around the原创 2017-07-30 16:38:45 · 1921 阅读 · 0 评论 -
POJ 2516 Minimum Cost (费用流)
题面Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply places (原创 2017-08-03 20:15:51 · 444 阅读 · 0 评论 -
POJ 1087 A Plug for UNIX (网络流,最大流)
题面You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an international mandate to make the free flow of information and i原创 2017-08-03 15:48:02 · 259 阅读 · 0 评论 -
POJ 3167 Layout(差分约束)
题面Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The cows are standi原创 2017-07-30 17:03:22 · 293 阅读 · 0 评论 -
POJ 1791 Heavy Transportation(最大生成树)
题面Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his c原创 2017-07-26 23:11:28 · 262 阅读 · 0 评论 -
POJ 2253 Frogger(最小生成树)
题面Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists’ su原创 2017-07-26 14:31:43 · 292 阅读 · 0 评论 -
【POJ1704】Georgia and Bob(博弈论)
题面POJ Vjudge题解这种一列格子中移动棋子的问题一般可以看做成一个阶梯博弈。 将一个棋子向左移动时,它和前面棋子的距离变小,和后面棋子的距离变大,并且减小的值和增大的值是相等的,因此,这个过程我们就可以等价成一个阶梯博弈了。#include<cstdio>#include<iostream>#include<algorithm&...原创 2018-08-15 22:17:05 · 567 阅读 · 0 评论