Fork me on GitHub
摘要: 复习一下数据结构。。。。说不准下个星期就用上了只不过写的很简单,没有封装DoubleLinkList.h#ifndef GUARD_DoubleLinkList_h#define GUARD_DoubleLinkList_h#include <stdio.h>struct ListNode{ int data; ListNode *previous,*next;};ListNode* GetNewNode(int value);void Insert(ListNode*& head,int value);void Delete(ListNode*& head,int 阅读全文
posted @ 2012-04-10 13:10 _Lei 阅读(394) 评论(0) 推荐(0)
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1166敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12921 Accepted Submission(s): 5613Problem Description C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动 阅读全文
posted @ 2012-03-31 22:01 _Lei 阅读(444) 评论(0) 推荐(0)
摘要: 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): 7385 Accepted Submission(s): 3547Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the 阅读全文
posted @ 2012-03-31 20:32 _Lei 阅读(620) 评论(0) 推荐(0)
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1251统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 8595 Accepted Submission(s): 3436Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input输入数据的 阅读全文
posted @ 2012-03-30 17:04 _Lei 阅读(275) 评论(0) 推荐(0)
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1075What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 5996 Accepted Submission(s): 1830Problem DescriptionIgnatius is so lucky that he met a Martian yesterday. But he didn't 阅读全文
posted @ 2012-03-21 10:42 _Lei 阅读(418) 评论(0) 推荐(0)
摘要: 一道N久之前的题目了,等到今天才刷掉了:http://acm.hdu.edu.cn/showproblem.php?pid=1004Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37894 Accepted Submission(s): 13041Problem DescriptionContest time again! How excited it is to see balloons float 阅读全文
posted @ 2012-03-20 17:16 _Lei 阅读(468) 评论(0) 推荐(0)
摘要: 网上有很多资料,可是比较零散,我整理了一下这里我用webservice进行调用来显示天气预报: http://www.webxml.com.cn/Webservices/WeatherWebService.asmx 网站上提供了几个操作:getSupportCity 查询本天气预报Web Services支持的国内外城市或地区信息输入参数:byProvinceName = 指定的洲或国内的省份,若为ALL或空则表示返回全部城市;返回数据:一个一维字符串数组 String(),结构为:城市名称(城市代码)。getSupportDataSet 获得本天气预报Web Services支持的洲、国内外 阅读全文
posted @ 2012-03-04 11:58 _Lei 阅读(7321) 评论(30) 推荐(4)
摘要: 用Kruskal算法计算最小生成树时,将结点分成不同的集合,一开始所有的结点都在不同的集合将所有的边排序后(按照权值进行从小到大排序) 然后看每边的两个结点是否属于不同集合,如果不是,则可以将这条表加到最小生成树中,并把这两个结点放到同一个集合中,然后如此类推,直到最小生成树中有了n-1条边测试用例:上面说的那个集合,我用两个map来实现,好久没敲C++的代码,写的不好请见谅Edge.h#ifndef GUARD_Edge_h#define GUARD_Edge_h#include <string> using std::string;class Edge{public: Edge 阅读全文
posted @ 2012-02-25 01:29 _Lei 阅读(6809) 评论(0) 推荐(0)
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1874畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9293 Accepted Submission(s): 3099Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰 阅读全文
posted @ 2012-02-20 15:08 _Lei 阅读(504) 评论(0) 推荐(0)
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1010Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30063 Accepted Submission(s): 8184Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, 阅读全文
posted @ 2012-02-17 22:42 _Lei 阅读(420) 评论(0) 推荐(0)