bobten2008的专栏

BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4100 Accepted: 2369DescriptionGigel has a strange "balance" and he wants to poise it. Actually,

 Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4573 Accepted: 1800DescriptionConsider a tree T with N (1 For example, consider the tree: 

Help JimmyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5993 Accepted: 1840Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度

 Tiling Up BlocksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3016 Accepted: 1148DescriptionMichael The Kid receives an interesting game set from his

 Phone numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2456 Accepted: 852 Special JudgeDescriptionIn the present world you frequently meet a

Trade on VerweggistanTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1238 Accepted: 355DescriptionSince the days of Peter Stuyvesant and Abel Tasman, Du

 BUY LOW, BUY LOWERTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4981 Accepted: 1663DescriptionThe advice to "buy low" is half the formula to success

 City GameTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 3095 Accepted: 1181DescriptionBob is a strategy game programming specialist. In his new city b

 Cow CyclingTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1479 Accepted: 788<p class="pst">Description The cow bicycling team consists of N

 TripTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1629 Accepted: 372DescriptionAlice and Bob want to go on holiday. Each of them has planned a route,

 CornfieldsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3096 Accepted: 1459DescriptionFJ has decided to grow his own corn hybrid in order to help the

 The Secret NumberTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1704 Accepted: 564DescriptionYour job is to find out the secret number hidden in a mat

/*最近看到一道谷歌笔试题，“已知一颗无向无环连通图T的所有顶点和边的信息，现需要将其转换为一棵树，要求树的深度最小，请设计一个算法找到所有满足要求的树的根结点，并分析时空复杂度（描述算法即可，无需代码）”其实就是给定一个无向连通图，求以哪些顶点为根可以得到深度最小的树，思路比较简单，主要有两个步骤：（1）首先选取1号结点作为树根，进行一遍DFS，在DFS时计算每个节点

 http://acm.pku.edu.cn/JudgeOnline/problem?id=2901HotelTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 561 Accepted: 156DescriptionZebel, the tour co

 Best SequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2718 Accepted: 1062DescriptionThe twenty-first century is a biology-technology developing

 Magazine DeliveryTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1590 Accepted: 766DescriptionThe TTT Taxi Service in Tehran is required to deliver s

Triangle WarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1465 Accepted: 582DescriptionTriangle War is a two-player game played on the following trian

Team Them Up!Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3404 Accepted: 901 Special JudgeDescriptionYour task is to divide a number of persons i

Post OfficeTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9376 Accepted: 5027DescriptionThere is a straight highway with villages alongside the highway

Brackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13305 Accepted: 3585 Special JudgeDescriptionLet us define a regular brackets seque

PolygonTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2770 Accepted: 1129DescriptionPolygon is a game for one player that starts on a polygon with N ve

LITTLE SHOP OF FLOWERSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10554 Accepted: 4890DescriptionYou want to arrange the window of your flower shop

最优连通子集Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1329 Accepted: 668Description众所周知，我们可以通过直角坐标系把平面上的任何一个点P用一个有序数对(x, y)来唯一表示，如果x, y都是整数，我们就把点P称为整点，否

 Shopping OffersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2286 Accepted: 866DescriptionIn a shop each kind of product has a price. For example, th

Bridging signalsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6001 Accepted: 3285DescriptionOh no, theyve done it again, cries the chief designer a

 棋盘分割Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5827 Accepted: 2092>>Description将一个８*８的棋盘进行如下分割：将原棋盘割下一块矩形棋盘并使剩下部分也是矩形，再将剩下的部分继续如此分割，这样割了(n-1)次

 SupermarketTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1312 Accepted: 511DescriptionMr. Jones is an exemplary husband. Every Saturday morning Mrs.

 Crossed MatchingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1578 Accepted: 1020DescriptionThere are two rows of positive integer numbers. We can d

 Copying BooksTime Limit: 3000MS Memory Limit: 10000KTotal Submissions: 4431 Accepted: 1256DescriptionBefore the invention of book-printing, it was very hard to m

描述 给一个整数数组A={a1,a2,…an}, 将这个数组首尾相接连成一个环状，它的一个子序列是指这个数组连续的一段，比如a2,a3…ak，或者an,a1…ai。请从这个环上选取两个不重叠的非空子序列，使这两个子序列中的所有数字之和最大。在三个样例中分别选取的子序列是:样例一: {a1} {a3}样例二: {a1} {a3}样例三: {a5,a1} {a3} 输入 输入的第一行包含一个正整数T(1接下来每个测试数据包含两行，第一行是一个正整数n(2算法：分别求两段最大和以及两段最小和即