HDU - 随笔分类(第6页) - meekyan

HDU 5616 Jam's balance 背包DP

摘要：Jam's balance Problem Description Jim has a balance and N weights. (1≤N≤20)The balance can only tell whether things on different side are the same wei 阅读全文

posted @ 2016-01-30 23:39 meekyan 阅读(279) 评论(0) 推荐(0)

UVALive 4225 / HDU 2964 Prime Bases 贪心

摘要：Prime BasesProblem DescriptionGiven any integer base b >= 2, it is well known that every positive integer n can be uniquely represented in base b. Tha... 阅读全文

posted @ 2016-01-22 23:26 meekyan 阅读(273) 评论(0) 推荐(0)

UVALive 4223 / HDU 2962 spfa + 二分

摘要：TruckingProblem DescriptionA certain local trucking company would like to transport some goods on a cargo truck from one place to another. It is desir... 阅读全文

posted @ 2016-01-22 23:20 meekyan 阅读(229) 评论(0) 推荐(1)

UVALive 4222 /HDU 2961 Dance 大模拟

摘要：DanceProblem DescriptionFor a dance to be proper in the Altered Culture of Machinema, it must abide by the following rules:1. A dip can only appear 1 ... 阅读全文

posted @ 2016-01-22 17:22 meekyan 阅读(406) 评论(0) 推荐(1)

UVALive 4192/HDU 2959 Close Enough Computations 数学

摘要：Close Enough ComputationsProblem DescriptionThe nutritional food label has become ubiquitous. A sample label is shown to the right. On the label the n... 阅读全文

posted @ 2016-01-22 17:18 meekyan 阅读(207) 评论(0) 推荐(0)

HDU 5151 Sit sit sit 区间DP + 排列组合

摘要：Sit sit sit问题描述在一个XX大学中有NN张椅子排成一排，椅子上都没有人，每张椅子都有颜色，分别为蓝色或者红色。接下来依次来了NN个学生，标号依次为1,2,3,...,N。对于每个学生，他会找一张还没有人坐的椅子坐下来。但是如果这张椅子满足以下三个条件他就不会去坐。1. 这张椅子左右两... 阅读全文

posted @ 2015-12-25 16:20 meekyan 阅读(179) 评论(0) 推荐(0)

HDU 4169 树形DP

摘要：Wealthy FamilyProblem DescriptionWhile studying the history of royal families, you want to know how wealthy each family is. While you have various 'ne... 阅读全文

posted @ 2015-12-20 17:31 meekyan 阅读(233) 评论(0) 推荐(0)

HDU5597/BestCoder Round #66 (div.2) GTW likes function 打表欧拉函数

摘要：GTW likes functionMemory Limit: 131072/131072 K (Java/Others)问题描述现在给出下列两个定义： f(x)=f_{0}(x)=\sum_{k=0}^{x}(-1)^{k}2^{2x-2k}C_{2x-k+1}^{k},f_{n}(x)=f(f_... 阅读全文

posted @ 2015-12-13 13:34 meekyan 阅读(356) 评论(0) 推荐(0)

HDU5596/BestCoder Round #66 (div.2) 二分BIT/贪心

摘要：GTW likes gtMemory Limit: 131072/131072 K (Java/Others)问题描述从前，有nn只萌萌的GT，他们分成了两组在一起玩游戏。他们会排列成一排，第ii只GT会随机得到一个能力值b_ibi。在第ii秒的时候，第ii只GT可以消灭掉所有排在他前面的和他... 阅读全文

posted @ 2015-12-13 13:30 meekyan 阅读(272) 评论(0) 推荐(0)

HDU 5596/BestCoder Round #66 (div.2) GTW likes math 签到

摘要：GTW likes mathMemory Limit: 131072/131072 K (Java/Others)问题描述某一天，GTW听了数学特级教师金龙鱼的课之后，开始做数学《从自主招生到竞赛》。然而书里的题目太多了，GTW还有很多事情要忙（比如把妹），于是他把那些题目交给了你。每一道题目会给你... 阅读全文

posted @ 2015-12-13 13:25 meekyan 阅读(183) 评论(0) 推荐(0)

HDU4003 Find Metal Mineral 树形DP

摘要：Find Metal MineralProblem DescriptionHumans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connect... 阅读全文

posted @ 2015-12-08 19:25 meekyan 阅读(163) 评论(0) 推荐(0)

hdu5593/ZYB's Tree 树形dp

摘要：ZYB's TreeMemory Limit: 131072/131072 K (Java/Others)问题描述ZYBZYB有一颗NN个节点的树,现在他希望你对于每一个点,求出离每个点距离不超过KK的点的个数.两个点(x,y)(x,y)在树上的距离定义为两个点树上最短路径经过的边数,为了节约读入和... 阅读全文

posted @ 2015-12-06 16:47 meekyan 阅读(270) 评论(0) 推荐(0)

HDU5568/BestCoder Round #63 (div.2) B.sequence2 dp+高精度

摘要：sequence2Problem DescriptionGiven an integer arraybiwith a length ofn, please tell me how many exactly different increasing subsequences.P.S. A subseq... 阅读全文

posted @ 2015-11-21 22:24 meekyan 阅读(341) 评论(0) 推荐(0)

HDU5567/BestCoder Round #63 (div.2) A sequence1 水

摘要：sequence1Given an arrayawith lengthn, could you tell me how many pairs(i,j)( i #include #include #include #include #include #include #include #include... 阅读全文

posted @ 2015-11-21 22:21 meekyan 阅读(175) 评论(0) 推荐(0)

HDU 4099 Revenge of Fibonacci Trie+高精度

摘要：Revenge of FibonacciProblem DescriptionThe well-known Fibonacci sequence is defined as following:Here we regard n as the index of the Fibonacci number... 阅读全文

posted @ 2015-11-21 00:16 meekyan 阅读(225) 评论(0) 推荐(0)

HDU 5538/ 2015长春区域 L.House Building 水题

摘要：题意：求给出图的表面积，不包括底面///1085422276#includeusing namespace std ;typedef long long ll;#define mem(a) memset(a,0,sizeof(a))#define meminf(a) memset(a,127,siz... 阅读全文

posted @ 2015-11-19 14:18 meekyan 阅读(189) 评论(0) 推荐(0)

HDU 5536/ 2015长春区域 J.Chip Factory Trie

摘要：Chip FactoryProblem DescriptionJohn is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of produc... 阅读全文

posted @ 2015-11-19 14:16 meekyan 阅读(307) 评论(0) 推荐(0)

HDU 5534/ 2015长春区域H.Partial Tree DP

摘要：Partial TreeProblem DescriptionIn mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two nodes are connect... 阅读全文

posted @ 2015-11-19 14:12 meekyan 阅读(229) 评论(0) 推荐(0)

HDU 5533/ 2015长春区域 G.Dancing Stars on Me 暴力

摘要：Dancing Stars on MeProblem DescriptionThe sky was brushed clean by the wind and the stars were cold in a black sky. What a wonderful night. You observ... 阅读全文

posted @ 2015-11-19 14:08 meekyan 阅读(349) 评论(0) 推荐(0)

HDU 5532 / 2015ACM/ICPC亚洲区长春站 F.Almost Sorted Array

摘要：Almost Sorted ArrayProblem DescriptionWe are all familiar with sorting algorithms: quick sort, merge sort, heap sort, insertion sort, selection sort, ... 阅读全文

posted @ 2015-11-19 14:04 meekyan 阅读(443) 评论(0) 推荐(0)

Meek

Time to sleep! again.

随笔分类 - HDU

公告