![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
POJ
文章平均质量分 83
Tabris_
梦想还是要有的,万一实现了呢。
展开
-
POJ 1611 The Suspects [简单并查集应用]
中文版的题目很人性化 有木有 B - The Suspects Time Limit:1000MS Memory Limit:20000KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 严重急性呼吸系统综合症( SARS), 一种原因不明的非典型性肺炎,从2003年3月中旬开始被认为是全球威胁。为了减少传播给原创 2016-03-01 17:48:23 · 1038 阅读 · 0 评论 -
POJ 3252 Round Numbers [数位DP]【动态规划】
题目连接:http://poj.org/problem?id=3252 —————————–. Round Numbers Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 12190 Accepted: 4629 DescriptionThe cows, as you know, have no原创 2016-08-25 23:11:27 · 492 阅读 · 0 评论 -
HDU 5895&&2016 ACM/ICPC Asia Regional Shenyang Online1004 Mathematician QSC [矩阵加速+欧拉降幂]【数论】
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5895 ————————. Mathematician QSCTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 222 Accep原创 2016-09-19 20:02:35 · 579 阅读 · 0 评论 -
POJ 1091 跳蚤 [容斥原理]【组合数学】
题目链接:http://poj.org/problem?id=1091 ———————————.跳蚤Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9828 Accepted: 2996DescriptionZ城市居住着很多只跳蚤。在Z城市周六生活频道有一个娱乐节目。一只跳蚤将被请上一个高空钢丝的正中央。钢原创 2016-09-21 20:04:19 · 612 阅读 · 0 评论 -
POJ 1305 Fermat vs. Pythagoras [本源毕达哥拉斯不等式]【数论】
题目链接:http://poj.org/problem?id=1305 ——————————-. Fermat vs. Pythagoras Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 1561 Accepted: 913 DescriptionComputer generated and assi原创 2016-09-21 21:39:52 · 456 阅读 · 0 评论 -
POJ 2823 Sliding Window [单调队列]【杂类】
题目链接:http://poj.org/problem?id=2823 ——————————–. Sliding Window Time Limit: 12000MS Memory Limit: 65536K Total Submissions: 55854 Accepted: 16062 Case Time Limit: 5000MS DescriptionAn原创 2016-10-31 17:37:05 · 303 阅读 · 0 评论 -
POJ 2528 Mayor's posters [线段树-区间更新+离散化]【数据结构】
题目链接:http://poj.org/problem?id=2528 ——————————————-. Mayor’s posters Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 60379 Accepted: 17492 DescriptionThe citizens of Bytetow原创 2016-11-16 19:09:12 · 421 阅读 · 0 评论 -
POJ 2828 Buy Tickets [线段树-单点更新]【数据结构】【好题】
POJ 2828 Buy Tickets 逆序操作+思维,线段树好题原创 2016-11-14 19:49:32 · 398 阅读 · 0 评论 -
POJ 2886 Who Gets the Most Candies? [线段树-单点更新]【数据结构】
题目链接:http://poj.org/problem?id=2886————————————. Who Gets the Most Candies? Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 13899 Accepted: 4397 Case Time Limit: 2000MS Des原创 2016-11-15 20:30:35 · 280 阅读 · 0 评论 -
POJ 1436 Horizontally Visible Segments [线段树-区间更新]【数据结构】
题目链接:http://poj.org/problem?id=1436 ————————————————————————-. Horizontally Visible Segments Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5262 Accepted: 1932 DescriptionTher原创 2016-12-09 17:08:59 · 362 阅读 · 0 评论 -
POJ 3667 Hotel [线段树+区间更新]【数据结构】
题目链接:http://poj.org/problem?id=3667———————————————————————————. Hotel Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 16674 Accepted: 7234 DescriptionThe cows are journeying原创 2016-12-28 19:13:06 · 396 阅读 · 0 评论 -
POJ 2796 Feel Good 【单调栈】
题目链接:http://poj.org/problem?id=2796—————————————————————————————————-. Feel Good Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 13624 Accepted: 3807 Case Time Limit: 1000MS原创 2017-01-07 01:11:20 · 534 阅读 · 0 评论 -
容斥原理习题
练习题目VJ:https://vjudge.net/contest/77876#overviewHDU 1796 How many integers can you find戳这里HDU 1685 Booksort这题应该是整错了 不是容斥原理,看题解都是IDA*搜索HDU 2204 Eddy’s爱好戳这里HDU 4407 Sum对于替换的先不管 最后暴力处理即可, 不替换的时候可原创 2017-02-11 23:09:40 · 1397 阅读 · 0 评论 -
POJ 2763 Housewife Wind [树链剖分(边权)+树状数组]【数据结构】
题目连接:http://poj.org/problem?id=2763 ————————————————————————–. Housewife Wind Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 10703 Accepted: 2969 DescriptionAfter their roy原创 2017-03-09 22:59:37 · 406 阅读 · 0 评论 -
POJ 2104 K-th Number [主席树入门]【数据结构】
题目链接:http://poj.org/problem?id=2104 ———————————————————————————————————————————————— K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 53824 Accepted: 18506 Case T原创 2017-03-10 21:51:50 · 622 阅读 · 0 评论 -
POJ 2187 Beauty Contest [旋转卡壳]【计算几何】
题目链接:http://poj.org/problem?id=2187 ———————————————————————————————————————————— Beauty Contest Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 36877 Accepted: 11417 Descrip原创 2017-03-29 19:57:49 · 522 阅读 · 0 评论 -
BZOJ 1895 & POJ 3580 supermemo [SPLAY]【数据结构】
SPLAY 入门级别题目区间加,翻转,剪切,询问最值。点插入,删除。原创 2017-06-20 20:43:37 · 831 阅读 · 3 评论 -
POJ 3460 Father Christmas flymouse [强连通缩点+最长路]【图论】
题目链接:http://poj.org/problem?id=3160 ———————————————————————————————————————— Father Christmas flymouse Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 3483 Accepted: 1187 Desc原创 2017-06-08 20:15:31 · 332 阅读 · 0 评论 -
POJ 2142 The Balance [不定方程和最小的正整数解]【数论】
题目链接:http://poj.org/problem?id=2142——————————————–.The Balance Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5998 Accepted: 2610 DescriptionMs. Iyo Kiffa-Australis has a balanc原创 2016-09-16 17:15:30 · 1841 阅读 · 1 评论 -
POJ 2689 Prime Distance [筛法选取素数]【数论】
题目链接:http://poj.org/problem?id=2689 ————————-. Prime Distance Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16728 Accepted: 4450 DescriptionThe branch of mathematics calle原创 2016-09-16 14:01:15 · 904 阅读 · 0 评论 -
POJ 2513 Colored Sticks [tire树+并查集]
题目连接 : 传送阵———————————————-. Colored Sticks Time Limit: 5000MS Memory Limit: 128000K Total Submissions: 35437 Accepted: 9287 DescriptionYou are given a bunch of wooden sticks. Each endpo原创 2016-08-10 10:57:04 · 307 阅读 · 0 评论 -
hdu 1847 Nim博弈
博弈问题巴士博弈HDU1846<-点击此处进入链接威尔夫博弈HDU1527<-点击此处进入链接斐波那契博弈HDU2516<-点击此处进入链接尼姆博弈HDUXXX<-点击此处进入链接题目链接:poj zoj 题意:有 N 堆石子,两人轮流从任一堆中取任意个石子(至少一个),最后一个取石子的人为胜利者。若先取者胜利,则输出第一次拿走石头的方法一共可以有多少种。 分析: 求出一个必胜局面有多少种方原创 2016-03-06 15:28:21 · 621 阅读 · 0 评论 -
POJ 3768 Repeater 较复杂 分形 题目
本题网址<-点此进入链接Repeater Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4187 Accepted: 1114 Description Harmony is indispensible in our daily lifeand no one can live without it—-may be Fa原创 2016-03-08 14:06:30 · 1250 阅读 · 0 评论 -
POJ 1654 Area 【叉乘+外积的几何意义】【计算几何】
题目链接—> 点此传送阵Area Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17766 Accepted: 4925 DescriptionYou are going to compute the area of a special kind of polygon. One vertex of原创 2016-04-01 13:54:06 · 985 阅读 · 0 评论 -
HDU 1325&POJ 1308 Is it A tree ? [并查集+树判定]
题目链接 poj hduIs It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 421 Accepted Submission(s): 157Problem DescriptionA tree is a well-kno原创 2016-03-09 21:06:53 · 599 阅读 · 0 评论 -
HDU1829&POJ 2492 a bug's life [并查集||二分图染色]
POJ 2492 a bug’s life [并查集||二分图染色]题目链接:POJ<-点此进入链接 HDU<-点此进入链接 A Bug’s Life Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 32887 Accepted: 10772 DescriptionBackgrou原创 2016-03-10 17:36:49 · 586 阅读 · 0 评论 -
POJ 2318 TOYS [叉积判断+二分查找]【计算几何】
题目链接:http://poj.org/problem?id=2318TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13008 Accepted: 6269 DescriptionCalculate the number of toys that land in each bin of a partition原创 2016-04-05 13:59:34 · 710 阅读 · 0 评论 -
POJ 2398 Toy Storage [叉积判断+二分查找]【计算几何】
题目链接:http://poj.org/problem?id=2398Toy Storage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4962 Accepted: 2950 DescriptionMom and dad have a problem: their child, Reza, never puts h原创 2016-04-05 14:42:26 · 514 阅读 · 0 评论 -
POJ 3304 Segments [枚举+叉乘判断线段相交]【计算几何】
题目链接 http://poj.org/problem?id=3304Segments Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11920 Accepted: 3757 DescriptionGiven n segments in the two dimensional space, write a prog原创 2016-04-05 17:31:08 · 2508 阅读 · 2 评论 -
POJ 2954 Triangle [PICK公式+GCD]【计算几何】
题目链接 :http://poj.org/problem?id=2954Triangle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5661 Accepted: 2439 DescriptionA lattice point is an ordered pair (x, y) where x and原创 2016-04-12 14:03:33 · 629 阅读 · 0 评论 -
POJ 2546 Circular Area [相交园面积]【计算几何】
题目链接:http://poj.org/problem?id=2546Circular Area Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5662 Accepted: 2215 DescriptionYour task is to write a program, which, given two原创 2016-04-08 21:48:50 · 1536 阅读 · 0 评论 -
POJ 1066 Treasure Hunt [线段相交]【计算几何】
题目链接 :http://poj.org/problem?id=1066Treasure Hunt Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6260 Accepted: 2598 DescriptionArcheologists from the Antiquities and Curios Mus原创 2016-04-10 18:36:31 · 699 阅读 · 0 评论 -
POJ 2635 The Embarrassed Cryptographer [高精度求余+同余模定理]【数论】
ACMer与Coder的交流分享地POJ2635-The Embarrassed Cryptographer转载请注明出处:優YoU http://user.qzone.qq.com/289065406/blog/1309305108大致题意:给定一个大数K,K是两个大素数的乘积的值。再给定一个int内的数L问这两个大素数中最小的一个是否小于L,如果小于则输出这个素数。解题思路:首先对题目的插图表转载 2016-04-29 14:45:29 · 463 阅读 · 0 评论 -
POJ 2955 Brackets [区间DP]【动态规划】
题目链接: http://poj.org/problem?id=2955 ———————————. Brackets Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6430 Accepted: 3443 DescriptionWe give the following inductive defini原创 2016-08-27 14:49:48 · 529 阅读 · 0 评论 -
POJ 2769 Reduced ID Numbers [同余]【数论】
题目连接:http://poj.org/problem?id=2769 ——————————-. Reduced ID Numbers Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 9927 Accepted: 3960 DescriptionT. Chur teaches various group原创 2016-09-12 00:25:33 · 393 阅读 · 0 评论 -
POJ 2115 C Looooops [扩展欧几里得]【数论】[水]
题目链接:http://poj.org/problem?id=2115 ———————————-. C Looooops Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 24028 Accepted: 6658 DescriptionA Compiler Mystery: We are given原创 2016-09-13 12:29:47 · 513 阅读 · 0 评论 -
POJ 3233 Matrix Power Series [矩阵快速幂]【数论】[水]
题目链接 : http://poj.org/problem?id=3233—————————————–. Matrix Power Series Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 20930 Accepted: 8760 DescriptionGiven a n × n matrix原创 2016-09-13 17:00:13 · 351 阅读 · 0 评论 -
POJ 1611 The Suspects 【并查集】
The Suspects Time Limit:1000MS Memory Limit:20000KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 严重急性呼吸系统综合症( SARS), 一种原因不明的非典型性肺炎,从2003年3月中旬开始被认为是全球威胁。为了减少传播给别人的机会, 最好的策略是隔离可能的患者原创 2016-03-09 13:08:53 · 331 阅读 · 0 评论 -
POJ 1741 Tree [点分治入门题]【分治】
题目链接:http://poj.org/problem?id=1741 —————————————————————————————————————————— Tree Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 22808 Accepted: 7542 DescriptionGive a tr原创 2017-07-17 20:37:58 · 480 阅读 · 0 评论