![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
poj
GoForer
这个作者很懒,什么都没留下…
展开
-
poj-1061青蛙的约会(扩展欧几里德算法)
欧几里德算法(辗转相除法,求两个数的最小公约数) 扩展欧几里德算法是用来在已知a, b求解一组x,y,使它们满足贝祖等式等式: ax+by = gcd(a, b) =d(解一定存在,根据数论中的相关定理)。扩展欧几里德常用在求解模线性方程及方程组中。 由欧几里德算法知 :gcd(a,b)= gcd(b,a%b);前提b不为0; 第一次看到这个题用暴力去解(x+mk)modL=(y+nk)mo...原创 2018-02-26 22:06:41 · 212 阅读 · 0 评论 -
Jungle Roads POJ - 1251 (最小生成树)&& Networking POJ - 1287
Language:DefaultJungle RoadsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 31303Accepted: 14670Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of...原创 2018-08-03 18:39:15 · 137 阅读 · 0 评论 -
POJ - 2236 Wireless Network(并查集)
An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershoc...原创 2018-08-03 19:40:33 · 110 阅读 · 0 评论 -
POJ-2492 A Bug's Life (种类并查集)
A Bug’s Life Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and...原创 2018-08-01 10:58:44 · 364 阅读 · 0 评论 -
POJ-2823 Sliding Window(单调队列)
Sliding Window An array of size n ≤ 10 6 is given to you. There is a sliding window of size k which is moving from the very left of the array ...原创 2018-08-01 19:48:16 · 164 阅读 · 0 评论 -
POJ 3250 Bad Hair Day (单调栈)
Bad Hair Day Some of Farmer John’s N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count ...原创 2018-08-02 09:00:59 · 199 阅读 · 0 评论