茶飘香~

摘要： 题目链接 http://acm.split.hdu.edu.cn/showproblem.php?pid=5379 Problem Description Little sun is an artist. Today he is playing mahjong alone. He suddenly 阅读全文

摘要： 题目链接：HDU 5355 http://acm.split.hdu.edu.cn/showproblem.php?pid=5355 Problem Description There are m soda and today is their birthday. The 1-st soda has 阅读全文

摘要： 原题链接 Problem Description There are n people and m pairs of friends. For every pair of friends, they can choose to become online friends (communicating 阅读全文

摘要： 原题链接 Problem Description You are a "Problem Killer", you want to solve many problems. Now you have n problems, the i-th problem's difficulty is repres 阅读全文

摘要： 原题链接 Problem Description Tom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has 阅读全文

摘要： 原题链接 Problem Description You may heard of the Joseph Problem, the story comes from a Jewish historian living in 1st century. He and his 40 comrade sol 阅读全文

摘要： 原题链接 Problem Description Given some segments which are paralleled to the coordinate axis. You need to count the number of their intersection.The input 阅读全文

摘要： 原题链接 描述 有N堆石子排成一排，每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆，每次合并花费的代价为这两堆石子的和，经过N-1次合并后成为一堆。求出总的代价最小值。 对于石子合并问题，有一个最好的算法，那就是GarsiaWachs算法。时间复杂度为O( 阅读全文

摘要： 题目链接 描述 暑假来了，hrdv 又要留学校在参加ACM集训了，集训的生活非常Happy（ps：你懂得），可是他最近遇到了一个难题，让他百思不得其解，他非常郁闷。。亲爱的你能帮帮他吗？ 问题是我们经常见到的整数划分，给出两个整数 n , m ,要求在 n 中加入m - 1 个乘号，将n分成m段，求 阅读全文

摘要： 原题链接 Problem Description The soil is cracking up because of the drought and the rabbit kingdom is facing a serious famine. The RRC(Rabbit Red Cross) o 阅读全文