2013年7月25日

HDU 4618 Palindrome Sub-Array （2013多校2 1008 暴力）

摘要： Palindrome Sub-ArrayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 173Accepted Submission(s): 80Problem Description A palindrome sequence is a sequence which is as same as its reversed order. For example, 1 2 3 2 1 is a palindrome sequence, but 1. 阅读全文

posted @ 2013-07-25 23:05 kuangbin 阅读(396) 评论(0) 推荐(0) 编辑

HDU 4617 Weapon (简单三维计算几何，异面直线距离)

摘要： WeaponTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 22Accepted Submission(s): 18Problem Description Doctor D. are researching for a horrific weapon. The muzzle of the weapon is a circle. When it fires, rays form a cylinder that runs through the . 阅读全文

posted @ 2013-07-25 21:14 kuangbin 阅读(1154) 评论(0) 推荐(0) 编辑

HDU 4612 Warm up（2013多校2 1002 双连通分量）

摘要： Warm upTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 90Accepted Submission(s): 12Problem Description N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel between any two planet 阅读全文

posted @ 2013-07-25 17:59 kuangbin 阅读(1776) 评论(0) 推荐(0) 编辑

HDU 4619 Warm up 2（2013多校2 1009 二分匹配）

摘要： Warm up 2Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 28Accepted Submission(s): 8Problem Description Some 1×2 dominoes are placed on a plane. Each dominoe is placed either horizontally or vertically. It's guaranteed the dominoes in the 阅读全文

posted @ 2013-07-25 17:34 kuangbin 阅读(869) 评论(0) 推荐(0) 编辑

HDU 4614 Vases and Flowers (2013多校2 1004 线段树)

摘要： Vases and FlowersTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 38Accepted Submission(s): 10Problem Description Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers,. 阅读全文

posted @ 2013-07-25 17:33 kuangbin 阅读(2071) 评论(0) 推荐(0) 编辑

HDU 4611 Balls Rearrangement（2013多校2 1001题）

摘要： Balls RearrangementTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 25Accepted Submission(s): 8Problem Description Bob has N balls and A boxes. He numbers the balls from 0 to N-1, and numbers the boxes from 0 to A-1. To find the balls easily, he pu. 阅读全文

posted @ 2013-07-25 17:29 kuangbin 阅读(1580) 评论(7) 推荐(1) 编辑

HDU 4602 Magic Ball Game（离线处理，树状数组，dfs）

摘要： Magic Ball GameTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 640Accepted Submission(s): 169Problem DescriptionWhen the magic ball game turns up, Kimi immediately falls in it. The interesting game is made up of N balls, each with a weight of w[i] 阅读全文

posted @ 2013-07-25 10:32 kuangbin 阅读(640) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: