2014年4月24日
HDU 1087 Super Jumping! Jumping! Jumping!
摘要： Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know... 阅读全文
posted @ 2014-04-24 15:20 Hust_BaoJia 阅读(145) 评论(0) 推荐(0) 编辑
hdu 1176 免费馅饼
摘要： Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径... 阅读全文
posted @ 2014-04-24 15:10 Hust_BaoJia 阅读(129) 评论(0) 推荐(0) 编辑
HDU 1003 Max Sum
摘要： 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)... 阅读全文
posted @ 2014-04-24 15:05 Hust_BaoJia 阅读(137) 评论(0) 推荐(0) 编辑
转战HDU
摘要： 今天看了一道hust上的题目，是一道集合上的dp问题，自己写了一个代码，结果连样例都没有过，人生啊，我现在觉得，虽然在hust上做题，做的每一道题都是自己想出来的，可是由于很难找到题解，或者别人AC的代码！故真的很难拓宽自己的知识面，本来想转战POJ的，但是由于个人对POJ的文字排版不怎么喜欢，所以... 阅读全文
posted @ 2014-04-24 14:02 Hust_BaoJia 阅读(122) 评论(0) 推荐(0) 编辑
2014年4月23日
hust 1227 Join Together
摘要： 题目描述Tammy has a circle. There are 2*n (0#include #include #define MOD 100using namespace std;class BigInt{public: int v[512],L; BigInt(){ ... 阅读全文
posted @ 2014-04-23 21:55 Hust_BaoJia 阅读(217) 评论(0) 推荐(0) 编辑
hust 1218 Acman and his GirlFriend
摘要： 题目描述ACman has been studying in HUST for nearly four years, and he thinks Wuhan is a very beautiful city even though he doesn’t like the weird weather.... 阅读全文
posted @ 2014-04-23 18:07 Hust_BaoJia 阅读(323) 评论(0) 推荐(0) 编辑
hust 1036 Cell Phone Network
摘要： 题目描述Farmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to set u... 阅读全文
posted @ 2014-04-23 16:42 Hust_BaoJia 阅读(178) 评论(0) 推荐(0) 编辑
2014年4月22日
hust 1400 Longest common prefix
摘要： 题目描述 Given N string S[1], S[2]......, S[N], you are to find a pair of strings whose longest common prefix has the largest length.输入 There are multiple... 阅读全文
posted @ 2014-04-22 21:10 Hust_BaoJia 阅读(154) 评论(0) 推荐(0) 编辑
Trie 树
摘要： trie树就是字典树，就是花时间为空间的一种高效查找的数据结构#include#include#include#include#includeconst int maxn=26;int n,m;char s[51];typedef struct Trienode{ bool isStr,isc... 阅读全文
posted @ 2014-04-22 19:13 Hust_BaoJia 阅读(187) 评论(0) 推荐(0) 编辑
2014年4月21日
hust 1038 Running
摘要： 题目描述The cows are trying to become better athletes, so Bessie is running on a track for exactly N (1 #include#include#include#include#include#include#i... 阅读全文
posted @ 2014-04-21 19:46 Hust_BaoJia 阅读(364) 评论(0) 推荐(0) 编辑
努力