Foresee的博客

Time Limit: 3000MS    Memory Limit: 30000K描述BackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether the

题目链接：https://leetcode.com/problems/median-of-two-sorted-arrays/?tab=DescriptionDescriptionThere are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arra

题目链接：http://poj.org/problem?id=2479DescriptionGiven a set of n integers: A={a1, a2,…, an}, we define a function d(A) as below: d(A)=max1≤s1≤t1<s2≤t2≤n{∑i=s1t1ai+∑j=s2t2aj}d(A)=\max_{1\leq s1\leq t1<s2

题目链接：http://poj.org/problem?id=2342 Time Limit: 1000MS Memory Limit: 65536KDescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University

题目链接：http://algorithm.openjudge.cn/betaexam/C/ 总时间限制: 3000ms 内存限制: 65536kB描述设计一个数据结构，初始为空，支持以下操作：（1）增加一个元素，要求在log(n)时间内完成，其中n是该数据结构中当前元素的个数。注意：数据结构中允许有重复的元素。（2）返回当前元素集合的中位数，要求在常数时间内完成。如果当前元素的个数为偶数，那么返

题目链接：http://poj.org/problem?id=1179DescriptionPolygon is a game for one player that starts on a polygon with N vertices, like the one in Figure 1, where N=4. Each vertex is labelled with an integer and

二叉树的遍历及重建二叉树的遍历我们知道二叉树是一种常用的数据结构，包括内部节点和叶节点，每个节点有0-2个子女。对于一棵二叉树来说，我们一般从根节点开始遍历每个节点。二叉树的遍历一般有三种方法：前序遍历、中序遍历和后序遍历。 D / \

题目链接：http://poj.org/problem?id=2251DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It t

题目连接：http://poj.org/problem?id=1328 总时间限制: 500ms    内存限制: 65536kBDescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a

题目连接：http://dsa.openjudge.cn/sort/0809/总时间限制: 500ms    内存限制: 65536kB描述对于一个长度为N的整数序列A，满足i < j 且 Ai > Aj.的数对(i,j)称为整数序列A的一个逆序。 请求出整数序列A的所有逆序对个数。输入输入包含多组测试数据，每组测试数据有两行 第一行为整数N(1 <= N <= 20000)，当输入0时结束

题目连接：http://algorithm.openjudge.cn/betaexam/B/ 总时间限制: 1000ms    单个测试点时间限制: 100ms    内存限制: 65536kB描述有一群旅行爱好者，有一天，他们带回了n只蝴蝶回来。他们相信每一只都属于两个不同种类中的一种，为了讨论方便，我们称它们为A与B。他们想把n只标本分成两组——一些属于A且一些属于B——但是直接标记任何一个标

Find the Duplicate Number题目连接：Find the Duplicate NumberDescript Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate numb

Longest Palindromic Substring题目链接：Longest Palindromic SubstringDescriptionGiven a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example: I