POJ
这个好玩吗
Offer已在路上请耐心等待,准备入职的新人
展开
-
POJ-1679 The Unique MST
Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of ...原创 2018-04-30 21:17:11 · 137 阅读 · 0 评论 -
POJ-1061 青蛙的约会
考查扩展欧几里德// 数论-扩展欧几里德#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <vector>#include <string>#include <queue>#include &原创 2017-05-13 14:17:29 · 296 阅读 · 0 评论 -
POJ-2823 Sliding Window
An array of size n ≤ 10 6 is given to you. There is a sliding window of size kwhich is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time...原创 2018-05-04 23:38:25 · 219 阅读 · 0 评论 -
POJ-3264 Balanced Lineup
For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things ...原创 2018-05-04 23:42:34 · 254 阅读 · 0 评论 -
POJ-3368 Frequent values
You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). For each query, det...原创 2018-05-04 23:44:01 · 369 阅读 · 0 评论 -
POJ-3683 Priest John's Busiest Day
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 by...原创 2018-05-04 23:47:37 · 290 阅读 · 0 评论 -
POJ-1144 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 . No two places have the same number. The lines are bi...原创 2018-05-04 23:49:29 · 511 阅读 · 0 评论 -
POJ-2449 Remmarguts' Date
"Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story. "Prince Remmarguts lives in his kingdom UDF – U...原创 2018-05-04 23:52:59 · 233 阅读 · 0 评论 -
POJ-3255 Roadblocks
Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She...原创 2018-05-04 23:54:20 · 217 阅读 · 0 评论 -
POJ - 2299 Ultra-QuickSort
利用树状数组求逆序数,但是数据范围比较大,要使用离散化坐标参考:http://blog.csdn.net/guhaiteng/article/details/52138756// 树状数组求逆序数 + 离散化#include <cstdio>#include <string>#include <algorithm>#define MAX 500000...原创 2017-05-13 14:24:15 · 454 阅读 · 0 评论 -
POJ - 2352 Stars
注意输入有0出现,BIT不好处理,所以在输入的时候加1// 树状数组// http://blog.csdn.net/niushuai666/article/details/7389273#include <cstdio>#include <string.h>#define MAX 32000 + 10using namespace std;typedef...原创 2017-05-17 21:43:47 · 1333 阅读 · 0 评论 -
POJ -1330 Nearest Common Ancestors
A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the root...原创 2018-05-03 22:55:51 · 151 阅读 · 0 评论 -
POJ-2559 Largest Rectangle in a Histogram
A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows ...原创 2018-05-03 23:04:39 · 263 阅读 · 0 评论 -
POJ-2796 Feel Good
Bill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studying how good or bad days influent people's memories about some period of life. A new id...原创 2018-05-03 23:06:30 · 374 阅读 · 0 评论 -
POJ-2689 Prime Distance
The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the question of primali...原创 2018-04-30 21:25:57 · 119 阅读 · 0 评论 -
POJ - 2135 Farm Tour
就是从1走到n然后再走回来,一条边只能走一次,要求路径最短。// MCMF 最小费用最大流#include <cstdio>#include <vector>#include <string>#include <string.h>#include <queue>#define MAX 1000 + 5#define INF...原创 2017-05-23 15:41:46 · 336 阅读 · 0 评论 -
POJ - 1273 Drainage Ditche
最大流模版题,练习一下// 网络流#include <cstdio>#include <vector>#include <string.h>#include <queue>#define MAX 500#define INF 0x3fffffffusing namespace std;int c[MAX][MAX];int f...原创 2017-05-23 15:38:36 · 315 阅读 · 0 评论 -
POJ - 3067 Japan
// 树状数组求逆序数 + 几何关系#include <cstdio>#include <string.h>#include <algorithm>#define MAX 2020using namespace std;typedef long long LL;typedef struct { LL x; LL y;...原创 2017-05-17 21:46:40 · 401 阅读 · 0 评论 -
POJ - 2481 Cows
考查树状数组 + 排序// 树状数组 + 排序#include <cstdio>#include <string.h>#include <algorithm>#define MAX 100010using namespace std;typedef long long LL;typedef struct { LL x; LL...原创 2017-05-17 21:45:09 · 388 阅读 · 0 评论 -
POJ-3164 Command Network
After a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden and violent assault by KnuthOcean’s force has rendered a total failure of li...原创 2018-05-04 23:55:55 · 183 阅读 · 0 评论