jn_8316的博客

Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人，所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏，虽然在游戏中是个

统计难题Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 33209    Accepted Submission(s): 12620Problem DescriptionIgnatius最近遇到一个难题,老师交

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35308    Accepted Submission(s): 12249Problem DescriptionNowadays

LabyrinthTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 828    Accepted Submission(s): 377Problem Description度度熊是一只喜欢探险的熊，一次偶然落进了

Phone ListTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17853    Accepted Submission(s): 5957Problem DescriptionGiven a list of

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5873Football GamesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1204    Accepted Submis

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1698Just a HookTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28080    Accepted Submissi

题目链接：http://hdu.hustoj.com/showproblem.php?pid=5879题目：Problem DescriptionGiven an integer n, we only want to know the sum of 1/k2 where k from 1 to n.InputThere are multiple cases.For

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1864最大报销额Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22139    Accepted Submission

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3466Proud MerchantsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 5025    Accepted Subm

这道题用了最长上升子序列的思想，要有个maxn进行比较，得到最大。#include#includeusing namespace std;int main(){ int N,maxn=-10000,value[1100],dp[1100]; while(scanf("%d",&N)&&N) { for(int i=0;i<N;i++)

Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +

Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？ Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是城镇数目N ( < 1

运用了简单的动规，状态转移方程：dp[i][j]=dp[i-1][j-1]+dp[i-1][j+1]，只是要注意到第一棵树和最后一棵树，这两棵树到达的路径只有一条。#include#includeusing namespace std;int main(){ int n,start,ending,time; int dp[110][110]; while(sca

很简单的动规，水题一道，要注意输入与应用数塔时坐标的相对应#include#include#include using namespace std;int main(){ int T,n,a[110][110],dp[110][110]; scanf("%d",&T); while(T--) { scanf("%d",&n);

题目的链接：http://acm.hdu.edu.cn/showproblem.php?pid=2602Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bone

Bone Collector IITime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3987    Accepted Submission(s): 2068Problem DescriptionThe title

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2955RobberiesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20298    Accepted Submission

题目链接：http://hdu.hustoj.com/showproblem.php?pid=1902题目：Problem DescriptionOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek