分治、二分,三分
欧莎
啦啦啦,啦啦啦,让我们一起洗刷刷
展开
-
poj 2549 Sumsets
DescriptionGiven S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S.InputSeveral S, each consisting of a line containing an intege原创 2017-02-28 18:38:44 · 220 阅读 · 0 评论 -
hdu oj 2675 Equation Again(二分)
Problem DescriptionThis problem’s author is too lazy to write the problem description, so he only give you a equation like X(eY) == (eY)x, and the value of Y, your task is calculate the value of X原创 2017-03-07 19:33:05 · 455 阅读 · 0 评论 -
CodeForces 371C Hamburgers (二分)
Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread,原创 2017-03-10 21:45:32 · 212 阅读 · 0 评论 -
hdu 3714 Error Curves (三分)
Problem DescriptionJosephina is a clever girl and addicted to Machine Learning recently. Shepays much attention to a method called Linear Discriminant Analysis, whichhas many interesting propert原创 2017-03-10 21:41:04 · 271 阅读 · 0 评论 -
hdu 2285 Cup(二分,求圆台的体积)
Problem DescriptionThe WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height?The radius of the cup's top原创 2017-03-10 21:36:51 · 350 阅读 · 0 评论 -
hdu 2141 Can you find it?(二分)
Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+C原创 2017-03-10 21:33:20 · 162 阅读 · 0 评论 -
poj 3258 River Hopscotch (最小值最大化 二分+贪心)
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a ro原创 2017-03-02 08:58:41 · 345 阅读 · 0 评论 -
POJ 3273 Monthly Expense(二分,最大值最小化)
DescriptionFarmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤moneyi原创 2017-03-06 20:27:58 · 349 阅读 · 0 评论 -
Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals) B.(三分)
B. The Meeting Place Cannot Be Changedtime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe main road in Bytecity is a原创 2017-03-06 17:14:20 · 220 阅读 · 0 评论 -
zzuli 1919 (二分 最大值最小化)
Description晴天想把一个包含n个整数的序列a分成连续的若干段,且和最大的一段的值最小,但他有强迫症,分的段数不能超过m段,然后他就不会分了。。。他想问你这个分出来的和最大的一段的和最小值是多少?Input第一行输入一个整数t,代表有t组测试数据。 每组数据第一行为两个整数n,m分别代表序列的长度和最多可分的段数。 接下来一行包含n个整数表示序列。 0<=n<=50000 1<=m<=原创 2016-09-06 13:21:06 · 339 阅读 · 0 评论 -
poj 1905 Expanding Rods(二分)
DescriptionWhen a thin rod of length L is heated n degrees, it expands to a new length L'=(1+n*C)*L, where C is the coefficient of heat expansion.When a thin rod is mounted on two solid walls an原创 2017-03-01 20:51:01 · 188 阅读 · 0 评论 -
poj 1064 Cable master(二分+贪心+分数化整数)
Total Submissions: 42224 Accepted: 9054DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promise原创 2017-03-02 15:47:36 · 271 阅读 · 0 评论 -
CodeForces 672D (思维+二分)
We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poor.There are n citizens in Kekoland, each person原创 2017-03-17 20:03:44 · 257 阅读 · 0 评论 -
FZU oj 1759 Super A^B mod C (快速幂+指数循环节+欧拉函数)
Problem DescriptionGiven A,B,C, You should quickly calculate the result of A^B mod C. (1 InputThere are multiply testcases. Each testcase, there is one line contains three integers A, B and原创 2017-02-22 20:27:09 · 384 阅读 · 0 评论 -
FZU 1752 A^B mod C (快速幂+快乘)
Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionGiven A,B,C, You should quickly calculate the result of A^B mod C. (1<=A,B,C<2^63). InputThere are multiply testca原创 2017-02-20 21:11:52 · 1276 阅读 · 0 评论 -
poj 2456 Aggressive cows (二分)
DescriptionFarmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 <= xi <= 1,000,000,000).His C (2 <=原创 2017-03-12 15:41:53 · 207 阅读 · 0 评论