![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
二分三分
文章平均质量分 80
jiayuzun
这个作者很懒,什么都没留下…
展开
-
HDU 5726 GCD
GCD Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Give you a sequence of N(N≤100,000) integers : a1,...,an(0ai≤1000,000,000).原创 2017-03-28 12:34:13 · 413 阅读 · 0 评论 -
POJ 1434 Fill the Cisterns!
Fill the Cisterns! Time Limit: 5000MS Memory Limit: 10000K Description During the next century certain regions on earth will experience severe water shortages. Th原创 2017-03-23 23:47:49 · 199 阅读 · 0 评论 -
UVA - 714 Copying Books
题目链接:UVA 714 #include #include #include using namespace std; const int maxn = 10000000 + 5; int n, m; long long _max,left,right,_min; int a[maxn]; int ans[510]; bool judge(long long mid) //判断能原创 2017-03-23 23:41:13 · 262 阅读 · 0 评论 -
ZOJ 3203 Light Bulb
Light Bulb Time Limit: 1 Second Memory Limit: 32768 KB Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in h原创 2017-03-23 23:34:56 · 286 阅读 · 0 评论 -
CodeForces - 371C Hamburgers
C. Hamburgers time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Polycarpus loves hamburgers very much. He espe原创 2017-03-23 23:31:15 · 473 阅读 · 0 评论 -
POJ 3273 Monthly Expense
Monthly Expense Time Limit: 2000MS Memory Limit: 65536K Description Farmer John is an astounding accounting wizard and has realized he might run out of money to r原创 2017-03-23 23:24:44 · 222 阅读 · 0 评论 -
二分、三分查找算法模板
二分、三分查找算法的原理及实现代码。 简单定义 在一个单调有序的集合中查找元素,每次将集合分为左右两部分,判断解在哪个部分中并调整集合上下界,重复直到找到目标元素。 时间复杂度 O (logn),优于直接顺序查找O(n) 原理 左闭右开二分 123456789101112131415161718 int search2(int arr原创 2017-03-23 23:17:58 · 1836 阅读 · 0 评论 -
POJ 1905 Expanding Rods
Expanding Rods Time Limit: 1000MS Memory Limit: 30000K Description When a thin rod of length L is heated n degrees, it expands to a new length L'=(1+n*C)*L, where原创 2017-03-23 23:15:49 · 259 阅读 · 0 评论 -
POJ 3518 Prime Gap
Prime Gap Time Limit: 5000MS Memory Limit: 65536K Description The sequence of n − 1 consecutive composite numbers (positive integers that are not prime and not eq原创 2017-03-23 23:26:18 · 277 阅读 · 0 评论 -
HDU 2141 Can you find it?
Can you find it? Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others) Problem Description Give you three sequences of numbers A, B, C, then we give you a num原创 2017-03-23 23:27:45 · 273 阅读 · 0 评论 -
HDU 2899 Strange fuction
Strange fuction Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Now, here is a fuction: F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0原创 2017-03-23 23:50:46 · 291 阅读 · 0 评论 -
HDU 1969 Pie
Pie Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no,原创 2017-03-23 23:55:04 · 218 阅读 · 0 评论 -
HDU 5381 The sum of gcd
The sum of gcd Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description You have an array A,the length of A is n Let f(l,r)=∑ri=l∑rj=igcd原创 2017-04-12 23:07:04 · 338 阅读 · 0 评论