codeswarrior的博客

B. Distances to Zero time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given the array of integer numbers a0,

Cable master Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 31900   Accepted: 6827 Description Inhabitants of the Wonderland have decided to hold a regional p

下面谈一谈我对二分查找的理解 看上去二分查找主要会用到的是有两种，加上最简单的是三种，因为做过的题比较少，目前只先谈一谈对这三个的理解，以后做的题多了再修改 1.最朴素的二分 /**  * 二分查找，找到该值在数组中的下标，否则为-1  */ static int binarySerach(int[] array, int key) {     int left = 0;    

题目大意： 给你n个牛舍，把c只牛放在牛舍里，要求最近的两头牛之间距离最大。 思路： 直接二分，从最大长度开始二分查找，选取一个长度，然后选择两个牛圈大于等于这个长度进行安置牛，最后判断能不能把所有的牛放进去，如果可以left=mid找更大的，如果不行，说明太大了，right=mid找小一点的 #include #include #include

Magic Powder - 2  CodeForces - 670D2  The term of this problem is the same as the previous one, the only exception — increased restrictions. Input The first line contains two positive in

Telephone Lines POJ - 3662 Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the cables requir

Burning Midnight Oil CodeForces - 165B One day a highly important task was commissioned to Vasya — writing a program in a night. The program consists of n lines of code. Vasya is already ex

Mike and Chocolate Thieves CodeForces - 689C Bad news came to Mike's village, some thieves stole a bunch of chocolates from the local factory! Horrible! Aside from loving sweet things,

One-Dimensional Battle Ships CodeForces - 567D Alice and Bob love playing one-dimensional battle ships. They play on the field in the form of a line consisting of n square cells (that is,

Professor GukiZ and Two Arrays CodeForces - 620D Professor GukiZ has two arrays of integers, a and b. Professor wants to make the sum of...

Gadgets for dollars and pounds CodeForces - 609D Nura wants to buy k gadgets. She has only s burles for that. She can buy each gadget fo...

4个数和为051Nod - 1267给出N个整数，你来判断一下是否能够选出4个数，他们的和为0，可以则输出"Yes"，否则输出"No"。Input 第1行，1个数N，N为数组的长度(4 <= N <= 1000)第2 - N + 1行：Ai（-10^9 <= Ai<= 10^9) Output 如果可以选出4个数，使得他们的和为0，则输出"Yes"，否则输出"No"。 Sa

The Longest Straight FZU - 2216 ZB is playing a card game where the goal is to make straights. Each card in the deck has a number betwee...

Prefix Sums CodeForces - 837FConsider the function p(x), where x is an array of m integers, w...

Three-level Laser An atom of element X can exist in n distinct states with energies E1 < E2 < ... < En. Arkady wants to build a laser on this element, using a three-level s...

Monthly Expense Farmer 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 ...