/** * Definition for binary tree * struct
TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) :
val(x), left(...
分类:
其他好文 时间:
2014-07-22 23:07:34
阅读次数:
312
Given a binary tree, find its maximum depth.The
maximum depth is the number of nodes along the longest path from the root node
down to the farthest le...
分类:
其他好文 时间:
2014-07-22 23:07:13
阅读次数:
379
Problem B: The Largest CliqueGiven a directed
graphG, consider the following transformation. First, create a new graphT(G)to
have the same vertex set ...
分类:
其他好文 时间:
2014-05-01 14:09:34
阅读次数:
357
MaximumTime Limit:3000MSMemory Limit:0KB64bit IO
Format:%lld & %lluSubmitStatusDescriptionLetx1,x2,...,xmbe real numbers
satisfying the following cond...
分类:
其他好文 时间:
2014-05-01 01:13:54
阅读次数:
415
This is a two player game. Initially there
areninteger numbers in an array and playersAandBget chance to take them
alternatively. Each player can take...
分类:
其他好文 时间:
2014-04-30 20:34:38
阅读次数:
519
Problem D: Airport ExpressIn a small city
called Iokh, a train service,Airport-Express, takes residents to the airport
more quickly than other transpo...
分类:
其他好文 时间:
2014-04-30 13:53:23
阅读次数:
347
Problem C: A Walk Through the ForestJimmy
experiences a lot of stress at work these days, especially since his accident
made working difficult. To rel...
分类:
其他好文 时间:
2014-04-29 17:21:46
阅读次数:
368
Carmichael Numbers An important topic nowadays in
computer science is cryptography. Some people even think that cryptography is
the only important fi....
分类:
其他好文 时间:
2014-04-29 16:31:45
阅读次数:
504
uva 10084 Hotter Colder
题目大意:
有一个人玩游戏,起初是个左下角(0,0) 右上角(10,10)的矩形,有一个宝藏藏在这之间。这个人起初在(0,0) 每次走到一个点,会告诉你与原来的点相比距离宝藏近了还是远了,还是不变,根据这个每次求宝藏的范围(面积)。
解题思路:
每次相当于形成一个新的范围是凸包,只需要求这个凸包所有的点,然后按照极角排序,求面积。
这题wa了很多次,感觉代码略麻烦了一点点。
代码:见文章...
分类:
其他好文 时间:
2014-04-28 10:14:41
阅读次数:
370
每个正整数都可以分解成斐波那契数列中的几个数相加……
从大到小贪心法就可以了……
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define PI acos(-1.0)
#defi...
分类:
其他好文 时间:
2014-04-27 21:23:04
阅读次数:
371