随笔分类 -  HDU

上一页 1 2
HDU-5726 GCD
摘要：Problem DescriptionGive you a sequence of N(N≤100,000) integers : a1,...,an(0#include #include #include #include using namespace std;typedef long long... 阅读全文
posted @ 2016-07-21 23:13 _Wilbert 阅读(146) 评论(0) 推荐(0)
HDU-5723 Abandoned country
摘要：Problem DescriptionAn abandoned country has n(n≤100000) villages which are numbered from 1 to n. Since abandoned for a long time, the roads need to be... 阅读全文
posted @ 2016-07-21 19:59 _Wilbert 阅读(143) 评论(0) 推荐(0)
HDU 5721Palace
摘要：Palace Accepts: 28 Submissions: 307 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述为了寻找失去的爱人Cupid，Psyche需要完成... 阅读全文
posted @ 2016-07-18 20:17 _Wilbert 阅读(181) 评论(0) 推荐(0)
HDU-5720 Wool
摘要：Wool Accepts: 109 Submissions: 770 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述黎明时，Venus为Psyche定下了第二个任务。她... 阅读全文
posted @ 2016-07-18 20:14 _Wilbert 阅读(114) 评论(0) 推荐(0)
HDU-5719 Arrange
摘要：Arrange Accepts: 221 Submissions: 1401 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述Cupid一不小心将爱情之箭射到了自己，他爱... 阅读全文
posted @ 2016-07-18 20:10 _Wilbert 阅读(156) 评论(0) 推荐(0)
HDU-5718 Oracle
摘要：Oracle Accepts: 599 Submissions: 2576 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述曾经有一位国王，统治着一片未名之地。他膝下有三... 阅读全文
posted @ 2016-07-18 20:04 _Wilbert 阅读(122) 评论(0) 推荐(0)
HDU-1007 Quoit Design
摘要：题目大意：给你n个点，代表toy，求一个使得可以套住一个toy且只能套住一个toy的环的最大半径。解法：只需要求出所有点的最近点对的长度就可以解决了。但是如何求最近点对？ 最容易想到的就是暴力枚举所有点对，求出最小长度，然后就可以得到结果。但是复杂度为O(n^2)而这题n的范围是10... 阅读全文
posted @ 2016-05-20 10:15 _Wilbert 阅读(124) 评论(0) 推荐(0)
HDU - 5596 - GTW likes gt
摘要：这题是来自BestCoder Round #66的一道题目，不是很难，官方题解上说的也比较清楚了。O(nlog(n))的算法真心没考虑，一开始想的就是O(n)的算法，看了题解之后居然还是没想到O(nlogn)的算法怎么写。其实仔细想想，在第Ci秒结束时，B1, B2, B3, ... Bci都增加1... 阅读全文
posted @ 2015-12-17 16:21 _Wilbert 阅读(131) 评论(0) 推荐(0)
HDU-1074-Doing Homework
摘要：Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline o... 阅读全文
posted @ 2015-08-23 20:06 _Wilbert 阅读(140) 评论(0) 推荐(0)
HDU-5365-Run
摘要：Problem Description AFA is a girl who like runing.Today,he download an app about runing .The app can record the trace of her runing.AFA will s... 阅读全文
posted @ 2015-08-22 18:20 _Wilbert 阅读(151) 评论(0) 推荐(0)
HDU-5366-The mook jong
摘要：Problem Description ZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. ... 阅读全文
posted @ 2015-08-22 18:14 _Wilbert 阅读(124) 评论(0) 推荐(0)
HDU-5391-Zball in Tina Town
摘要：Problem DescriptionTina Town is a friendly place. People there care about each other.Tina has a ball called zball. Zball is magic. It grows larger eve... 阅读全文
posted @ 2015-08-22 17:36 _Wilbert 阅读(113) 评论(0) 推荐(0)

上一页 1 2