2015年07月_xiaohuihuicb

12月 11月 09月 08月 07月

原创 POJ3258—River Hopscotch—二分法求the largest mimmun

DescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straigh

2015-07-31 21:24:28 908

原创 POJ2456—Aggressive cows—二分法求 the largest minimum

DescriptionFarmer John has built a new long barn, with N (2 His C (2 <= C <= N) cows don't like this barn layout and become aggressive towards each other once put into a stall. To preven

2015-07-31 20:10:00 548

原创 HDU1565—方格取数(1)——状压DP

Problem Description给你一个n*n的格子的棋盘，每个格子里面有一个非负数。从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取的数所在的2个格子不能相邻，并且取出的数的和最大。Input包括多个测试实例，每个测试实例包括一个整数n 和n*n个非负数(nOutput对于每个测试实例，输出可能取得的最大的和Sample

2015-07-30 19:59:32 526

原创 POJ-2342::Anniversary party-树形DP

DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor rela

2015-07-30 15:40:06 467

原创 HDU --1157 Who's in the Middle——nth_element

DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as much o

2015-07-29 22:54:42 593

原创 sort 进行下标排序

在多个数据关联，需要进行排序又不想写结构体怎么办。一种很好的方法就是进行数组的下表排序。这里给出直接用库函数sort的下标排序。/**********************用sort对下标进行排序*********************/#include #include using namespace std;int a[8] = {0,8,65,1,4,1,3,5};

2015-07-29 21:11:00 3551

原创求逆序对——Ultra-QuickSort 题解解析

DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequenc

2015-07-29 20:32:16 654

原创贪心算法——Wooden Sticks

DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs som

2015-07-29 19:30:16 674

原创 POJ 1787 Charlie's Change 记录路径的多重背包

Charlie's ChangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3499 Accepted: 1032DescriptionCharlie is a driver of Advanced Cargo Movement, Ltd. Charl

2015-07-28 19:54:54 590

原创 SHU_OJ 1929:Yaoge的英语成绩题解

DescriptionYaoge和小伙伴们终于拿到了英语测试的成绩，大家开始讨论起各自的成绩,然而Yaoge身边都是智(yan)商(zhi)报表的同学们，他们不喜欢报出自己的成绩，只会说“我至少有XX分”，“我比XX至少高XX分”。作为Yaoge的朋友，你想知道他的成绩，于是你整理出了这两类信息：1. A的成绩至少是X分。(ScoreA >= X)2. A至少比B高X分。(Scor

2015-07-25 18:08:14 599

原创 Dijkstra算法几大模板

主要分为五部分邻接矩阵版主函数普通邻接表版vector版优先队列版算法思想：每次选出dis最小的那个点i，则dis[i]必定为为顶点s到顶点i的最短距离更新所有与i相邻的顶点的dis值依据：如果存在一条i到j的最短路径，其经过的节点为(i……k,j)。那么(i……k)的这条路径也必然是i到k的最短路径。每个版本的最初都是构建图，首先将图初始化，然后进行加边。对于

2015-07-23 17:07:34 3282 1