二分
文章平均质量分 70
ctsas
这个作者很懒,什么都没留下…
展开
-
阶乘因式分解问题
问题:N! 结果零的个数 分析: 求零的个数即10的因子个数,而10=5*2 即求5和2的对数 记N! 的因子x个数为ans(x) 显然在N! 中ans(2)>ans(5) 则ans(10)=min(ans(2),ans(5))=ans(5) 现在问题变为求ans(5)了 那么还是继续分析N!成分 N!数字 1 2 3 4 5 6 7 8 9 10 11 12 15 14 15原创 2016-12-08 17:40:29 · 370 阅读 · 0 评论 -
codeforces 782/problem/B [二分]
B. The Meeting Place Cannot Be Changed time limit per test 5 seconds memory limit per test 256 megabytes input standard input output standard output The main road in Byt原创 2017-04-04 09:47:41 · 392 阅读 · 0 评论 -
Codeforces Round #400 C. Molly's Chemicals [二分]
C. Molly’s Chemicals time limit per test2.5 seconds memory limit per test512 megabytes inputstandard input outputstandard output Molly Hooper has n different kinds of chemicals arranged in a line.原创 2017-03-21 22:36:59 · 590 阅读 · 0 评论 -
[51NOD] 1001 数组中和等于K的数对 [二分]
1001 数组中和等于K的数对原创 2017-02-26 15:57:29 · 315 阅读 · 0 评论 -
【POJ】3122 Pie 二分搜索
Pie Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16158 Accepted: 5497 Special Judge Description My birthday is coming up and traditionally I'm ser原创 2016-12-30 13:29:37 · 3097 阅读 · 0 评论 -
超级赛亚ACMer 二分搜索 upper_bound
百小度是一个ACMer,也是一个超级赛亚人,每个ACMer都有一个战斗力,包括百小度。 所谓超级赛亚人的定义,是说如果在对抗中刚好接近极限状态,那就会激发斗志,实力提升. 具体来说,就是百小度现在要接受一些ACMer的挑战了,这些ACMer有n个人,第i个人的战斗力是aii。 百小度接下来可以自主安排与这n个ACMer的PK顺序,他要想在PK赛中赢过另外一个ACMer,就必须使得自己的战斗力不小于原创 2016-12-24 21:49:58 · 444 阅读 · 0 评论 -
【HDU】 5101 Select 二分搜索 upper_bound
Problem Description One day, Dudu, the most clever boy, heard of ACM/ICPC, which is a very interesting game. He wants to take part in the game. But as we all know, you can’t get good result without te原创 2016-12-23 17:23:57 · 320 阅读 · 0 评论 -
Hard Process 二分搜索
描述 You are given an array a with n elements. Each element of a is either 0 or 1.Let’s denote the length of the longest subsegment of consecutive elements in a, consisting of only numbers one, as f(a).原创 2016-12-22 18:23:12 · 281 阅读 · 0 评论 -
The Frog's Games 二分搜索
描述 The annual Games in frogs’ kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the Ironfrog Triathlon is jumping. This project requires the frog athletes to jump over原创 2016-12-22 16:43:17 · 289 阅读 · 0 评论 -
Subsequence 二分搜索
描述 A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the原创 2016-12-22 11:42:21 · 259 阅读 · 0 评论 -
序列变换 二分搜索
描述 给定序列A={A1,A2,…,An}A={A1,A2,…,An}, 要求改变序列A中的某些元素,形成一个严格单调的序列B(严格单调的定义为:Bi#include<stdio.h> #include<algorithm> using namespace std; int n,a[100005]; bool check(int ans) { int last=a[0]-ans,now=原创 2016-12-22 10:23:36 · 675 阅读 · 1 评论 -
【POJ】3258 River Hopscotch 不仅仅是二分
River HopscotchTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 12303 Accepted: 5271 DescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch that involves c原创 2016-12-21 15:11:01 · 338 阅读 · 0 评论 -
[HDU-6304] Chiaki Sequence Revisited
Chiaki Sequence Revisited http://acm.hdu.edu.cn/showproblem.php?pid=6304 an={1an−an−1+an−1−an−2n=1,2n≥3an={1n=1,2an−an−1+an−1−an−2n≥3a_n=\begin{cases}1 & n = 1,2 \\ a_{n - a_{n-1}} + a_{n-1 - a_{n-2}...原创 2018-07-24 13:59:21 · 488 阅读 · 0 评论