qq_27478063的博客

0

这一章主要是二分三分dfsbfs这四个算法 写这几个算法或多或少总有点套路的感觉这一类题都有一定的规律 二分三分一个分解判定条件上界下届不断分 dfs按照某种方法一层一层的延伸下去找到结果返回 找不到结果在往下一种 bfs是相对最难理解的 利用队列来存储

Problem Description Now, here is a fuction:  F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100)Can you find the minimum value when x is between 0 and 100.   Input The first line

Problem Description A有1数m，B来猜.B每猜一次，A就说"太大"，"太小"或"对了" 。 问B猜n次可以猜到的最大数。   Input 第1行是整数T,表示有T组数据，下面有T行 每行一个整数n (1 ≤ n ≤ 30)   Output 猜n次可以猜到的最大数   Sample I

Problem Description Mr. West bought a new car! So he is travelling around the city.One day he comes to a vertical corner. The street he is currently in has a width x, the street he wants to turn to h

Problem Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to

Problem Description The recreation center of WHU ACM Team has indoor billiards, Ping Pang, chess and bridge, toxophily, deluxe ballrooms KTV rooms, fishing, climbing, and so on.We all like toxophily.

Problem Description 在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法。   Input 共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示结束。   Output 共有若干行，每行一个正整数，表示

Problem Description There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.W

Problem Description A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n

Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.N

roblem Description 大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐的体积为S （S<101）毫升　(正好装满一瓶) ，它们三个之间可以相互倒可乐 (都

Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates

Total Submission(s) : 59   Accepted Submission(s) : 18 Problem Description In a two-dimensional plane there are two line belts, there are two segments AB and CD, lxhgww's speed on AB is P and on

Problem Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adja

Can you solve this equation? Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 91   Accepted Submission(s) : 30 Problem Description Now,given t

Acm课程总结     Acm一开始了解这个是大一的时侯听说有一门特殊的选修课可以在大一选，同时一些学长学姐也说这门课挺难的也很有用，然后我就抱着试试的心态大一去上了前几节，说真的因为是学期末开的课比较突然前几节课其实具体实现并没有很懂只是听懂了一些算法的思想，后来由于我们测试的线性代数与课程冲突，翘了几节线代后线代老师允许了，同时发现线代本身需要学习，于是就放弃了。大二学java的时候想写点小