Must so

Your current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor building with walls to make apartments in the shape of a rectang

Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj.For a given sequence of numbers a1, a2, ..., an, if we mov

I-numberTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3968    Accepted Submission(s): 1415Problem DescriptionThe I-number of

CF上的代码是开放的，常常就能看到本渣与大神们的差距比如去重。。。这是本鶸代码。。。。。。。#include#include#includeusing namespace std;const int N = 100000;int a[N+5];int b[N+5];int main(){ int n; while (cin>>n) {

size()     目前容器正拥有的元素个数capacity() 容器能储存的元素个数，即容量reserve() 重新指定容器能存储数据的个数resize() 重新指定容器有效的元素个数设元素原本的v.size()是n 当调用v.resize(m)后，有两种情况：1.若 m 2.若m > n ，则容器之前储存的n个元素不变，不足m的部分补0#includeu

题目链接:点击打开链接题目大意是说给n个数,要求分成m组,必须连续的数才能合并成一个组,求满足ans大于等于每一组的和的最小ans(每个组可以只有1个数)显然二分查找最小的ans//Must so#include#include#include#include#include#include#include#include#include#include#

AssembleTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 628    Accepted Submission(s): 230Problem DescriptionRecently your team

创建一棵二叉查找树并分别用先序遍历中序遍历后序遍历输出其实根据二叉搜索树的特点,中序遍历的结果就是从小到大的顺序输出,但为了练习树我还是用递归输出的题目:DescriptionBinary Search Tree, abbreviated as BST, is a kind of binary tree maintains the following p

题目：HDU 1754 I hate it!//Must so#include#define mem(a,x) memset(a,x,sizeof(a))#define sqrt(n) sqrt((double)n)#define pow(a,b) pow((double)a,(int)b)#define inf 1<<29#define NN 200006using names

题目：HDU 1166 敌兵布阵线段树模板题同时也是树状数组模板题//Must so#include#define mem(a,x) memset(a,x,sizeof(a))#define sqrt(n) sqrt((double)n)#define pow(a,b) pow((double)a,(int)b)#define inf 1<<29#define NN 50004using name

AssignmentTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3361    Accepted Submission(s): 1563Problem DescriptionTom owns a comp

DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city counci

Problem DescriptionYou are given two strings s1[0..l1], s2[0..l2] and Q - number of queries.Your task is to answer next queries:  1) 1 a i c - you should set i-th character in a-th string to c

Problem DescriptionFantasy magicians usually gain their ability through one of three usual methods: possessing it as an innate talent, gaining it through study and practice, or receiving it from a

Problem DescriptionThere is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediat

Problem Description虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自己的阅历，还可以看美丽的风景……草儿想去很多地方，她想要去东京铁塔看夜景，去威尼斯看电影，去阳明山上看海芋，去纽约纯粹看雪景，去巴黎喝咖啡写信，去北京探望孟姜女……眼看寒假就快到了，这么一大

Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。 Input本题目包含多组数据，请处理到文件结束。

Problem DescriptionJack and Jill have decided to separate and divide their property equally. Each of their N mansions has a value between 1,000,000 and 40,000,000 dollars. Jack will receive some o

最大子序列和:HDU 1003 Max Sum用动态规划的思想，求解前i个数能获得的最大和，当sum如果sum > ans则更新ans和起点、终点。//Must so#include#include#include#define mem(a,x) memset(a,x,sizeof(a))#define sqrt(n) sqrt((double)n)#define pow(

给出两字符串,要求输出两字符串的最长公共子序列;这里有必要解释一下子串和子序列的区别,子串要求连续,子序列不必.也就是说,对于 "abckkkef" 和"abcef"这两字符串而言,他们最长的公共子串是"abc",而最长公共子序列是"abcef"最长公共子序列,最长上升子序列,很显然都是动态规划的思想,不同的是,"公共"的话是要对两个序列进行处理my code:#inc

题目被分类为dp,那么这样的解法应该也是dp吧题目:http://acm.hdu.edu.cn/showproblem.php?pid=1058注意一下输出格式就好[cpp] view plain copy//Must so  #include  #define mem(a,x) memset(a,x,si

题目:http://acm.hdu.edu.cn/showproblem.php?pid=1025第一次写最长上升子序列不是写的这题,所以对于这个最长上升子序列的模板题也没什么好说的,主要坑点在于,如果答案是一road用单数..............[cpp] view plain copy//Must so

Problem DescriptionHave you ever played the Warcraft?It doesn't matter whether you have played it !We will give you such an experience.There are so many Heroes in it,but you could only choose one

Problem Description　　春节将至，小明要去超市购置年货，于是小明去了自己经常去的都尚超市。　　刚到超市，小明就发现超市门口聚集一堆人。用白云女士的话说就是：“那家伙，那场面，真是人山人海，锣鼓喧天，鞭炮齐呤，红旗招展。那可真是相当的壮观啊！”。好奇的小明走过去，奋力挤过人群，发现超市门口贴了一张通知，内容如下：　　　　值此新春佳节来临之际，为了回馈广大顾客的支

Problem Description在众多武侠类游戏中，都可以看到主角衣袂飘飘地在一旁通过“气”操控剑在空中飞行来杀伤敌人的帅气场景。“十年磨一剑，霜刃未曾试”，在刻苦练习了不知道多少个日夜之后，今天你也掌握了这一项高超的武艺。虽然你可以并行地控制多柄剑同时飞行，但为了照顾普通群众的理解需求，暂时只考虑一把剑的情形。所谓御剑术，实质上就是通过“气”来传递信息给已经通灵的剑

Problem Description　　对于吃货来说，过年最幸福的事就是吃了，没有之一！　　但是对于女生来说，卡路里（热量）是天敌啊！　　资深美女湫湫深谙“胖来如山倒，胖去如抽丝”的道理，所以她希望你能帮忙制定一个食谱，能使她吃得开心的同时，不会制造太多的天敌。　　当然，为了方便你制作食谱，湫湫给了你每日食物清单，上面描述了当天她想吃的每种食物能带给她的幸福程度，以及会增

Problem DescriptionWe all know that English is very important, so Ahui strive for this in order to learn more English words. To know that word has its value and complexity of writing (the length o

Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of

Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When

DescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer len

Problem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrint

题目链接：POJ 3126 Prime Path题意：给出两个四位素数，要求从第一个素数变到第二个素数。           变换规则：每次只能改变四位数中的一个数，并且要求变换后的数依旧是素数。           求最少的变换次数。思路：先把1000-10000之间的数判断好是不是素数，之后直接用。           然后BFS搜索，每次变换一个数，变换后的数要求是素数，

Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个

Problem DescriptionIgnatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb

题目链接：点击打开链接事情是这样的，我先在TLE无数发之后A了POJ的1077，然后在VJ上看到“原题”，然而，此原题被我TLE5发MLE9发，最后从学长那里学得记录路径的方法之后才过，却原来，这道所谓原题并非原题！！！HDU 的1043和POJ的1077都叫Eight,但是由于HDU上是多组数据POJ上单组，所以POJ上直接正常bfs搜索， HDU上则需要预处理。。。方法是一样的

Holedox MovingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 15264 Accepted: 3686DescriptionDuring winter, the most hungry and severe time, Holedox sle

Problem Description　　Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry Potter has to go back to uncle Vernon's home.

Problem DescriptionIgnatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0注意:由于宝藏的历史久远,当时的系统最多只能保存500位密码.因此如果得到的密码长度大于500也不能用来开启房门

Description"Hike on a Graph" is a game that is played on a board on which an undirected graph is drawn. The graph is complete and has all loops, i.e. for any two locations there is exactly one arr

Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates