nowting的博客

题目地址：http://poj.org/problem?id=1330 这里主要给的是实现代码 然后结合这篇 博客 （<----点做这个博客）一起看会更加理解 实现代码如下： #include <iostream> #include <cstdio> #include <cstring> #include <vector> using...

题目链接：http://poj.org/problem?id=3368 Frequent values Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 24776 Accepted: 8632 Description You are given a sequence of n integers a1 , a2 , … , a...

题目链接：http://poj.org/problem?id=2823 Sliding Window Time Limit: 12000MS Memory Limit: 65536K Total Submissions: 81382 Accepted: 22902 Case Time Limit: 5000MS Description An array of size n ≤ 106 is g...

链接：http://poj.org/problem?id=2559 代码： // #include <bits/stdc++.h> #include <iostream> #include <cstdio> #include <stack> #include <cstring> using namespace std; #define l...

链接：http://poj.org/problem?id=1166 题目描述： The Clocks Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19016 Accepted: 7879 Description |-------| |-------| |-------| | | | ...

题目链接 TLE代码： #include <iostream> #include <cstdio> using namespace std; const int maxn=2e5+10; struct tr { int val; int le,ri; }tr[maxn<<2]; void build(int l,int r,int rt) { tr[...

Description Given a base b and two non-negative base b integers p and m, compute p mod m and print the result as a base b integer. p mod m is defined as the smallest non-negative integer k such that p...

公牛和母牛 Language: Bull Math Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16656 Accepted: 8491 Description Bulls are so much better at math than the cows. They can multiply huge integers ...

题目链接 http://poj.org/problem?id=1703 要注意，对于题目给出的编号来说，我们既可以将其归为A组，也可以将其归为B组，所以我们两个假设都处理。如果题目给出D 1 2，那么我们就将1和2+n合并为一个集合，然后再将1+n和2合并为另一个集合，对于D 2 3同样，此时一个集合为（1， 2+n， 3），另一个集合为（1+n， 2， 3+n）。 对于A 1 3来说，由于上...

Everybody is fond of computers, but buying a new one is always a money challenge. Fortunately, there is always a convenient way to deal with. You can replace your computer and get a brand new one, thu...

这份代码由于color最大值会&gt;10000,而1&lt;&lt;color肯定会炸的 #include &lt;iostream&gt; #include &lt;algorithm&gt; #include &lt;cstring&gt; #include &lt;cstdio&gt; #include &lt;map&gt; using namespace std; #define ...

题目链接：http://poj.org/problem?id=1015 题面： Jury Compromise Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 35458 Accepted: 9586 Special Judge Description In Frobnia, a far-away country, the...