- 博客(18)
- 收藏
- 关注
RSS订阅原创 poj 3628 Bookshelf 2 01背包
Bookshelf 2Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7167 Accepted: 3298DescriptionFarmer John recently bought another bookshelf for the cow lib
2014-04-27 22:37:45
691
原创 poj1050 To the Max 暴力DP
To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39290 Accepted: 20734DescriptionGiven a two-dimensional array of positive and negative integers,
2014-04-23 09:26:05
599
原创 set/multiset，map/multimap的使用与比较+pair介绍
set与multiset set跟priority_queue容器都把元素按照特定比较规则进行排序，他们的区别是：set在内部维护一棵红黑树，方便查询容器内的任一元素；priority_queue只能读取队头和队尾的元素，实际上只能找到容器内的最大最小元素，而且set是升序，priority_queue是头大尾小。【特点】①set容器保证每一次插入元素后容器内的元素都是有序的；
2014-04-19 13:34:08
1284
原创 poj 2385 Apple Catching 简单DP
Apple CatchingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7108 Accepted: 3469DescriptionIt is a little known fact that cows love apples. Farmer John h
2014-04-17 18:56:59
1080
原创 poj 1088 滑雪 深搜（谁说是DP了！）
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 72671 Accepted: 26825DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升
2014-04-17 15:08:46
806
原创 C#语言 SqlClient接口SQL Sever数据库类+OleDb接口Access数据库类
有空再写Oracle、IBM的吧using System;using System.Data;using System.Data.SqlClient;using System.Data.OleDb;namespace IDataBase{ public class SQLServer { /// /// 数据库连接字符串
2014-04-16 17:14:41
1272
原创 poj 1015 Jury Compromise 状态压缩DP（不压缩也行）
Jury CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24261 Accepted: 6313 Special JudgeDescriptionIn Frobnia, a far-away country, the verdicts in court trials are determi
2014-04-13 23:20:28
670
转载 poj DP（动态规划）题集
容易：1018, 1050, 1083, 1088, 1125, 1143, 1157, 1163, 1178, 1179, 1189, 1208, 1276, 1322, 1414, 1456, 1458, 1609, 1644, 1664, 1690, 1699, 1740, 1742, 1887, 1926, 1936, 1952, 1953, 1958, 1959, 1962, 197
2014-04-12 19:07:08
2246
原创 poj 1125 Stockbroker Grapevine——Floyd
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25234 Accepted: 13939DescriptionStockbrokers are known to overreact to rumours. You have been contracted to dev
2014-04-12 16:33:02
804
原创 poj 3259 Wormholes SPFA
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 28008 Accepted: 10080DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes.
2014-04-12 11:32:08
885
原创 poj 1062 昂贵的婚礼 Dijkstra
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34683 Accepted: 9912Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说："
2014-04-11 14:05:14
710
原创 poj 1002 487-3279 map的使用
487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 232988 Accepted: 40620DescriptionBusinesses like to have memorable telephone numbers. One way to make a telephone number mem
2014-04-08 23:23:40
1157
转载 图论精练500题
=============================以下是最小生成树+并查集======================================【HDU】1213 How Many Tables 基础并查集★1272 小希的迷宫 基础并查集★1325&&poj1308 Is It A Tree? 基础并查集★1856 More is better 基础并查集★
2014-04-04 11:23:55
1034
原创 最短路问题总结
一、单源最短路 单源最短路就是把图中某一个点当做起点，计算从起点到其余各点的最短路径。单源最短路的算法又因为图的特点分成两类：无负边权图的单源最短路和有负边权图的单源最短路。1、无负边权图的最短路——Dijkstra算法 这个算法是通过为每个顶点 v 保留目前为止所找到的从起点s到v的最短路径来工作的。初始时，起点s到自身 的路径长度值被赋为 0 （d[s] =
2014-04-03 23:40:54
1686
原创 poj 1094 Sorting It All Out 拓扑排序
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 26019 Accepted: 9009DescriptionAn ascending sorted sequence of distinct values is one in which some form of a less
2014-04-02 18:42:23
766
原创 poj 1789 Truck History 最小生成树
Truck HistoryTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16565 Accepted: 6364DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for v
2014-04-02 15:02:50
684
原创 poj 1861 Network 最小生成树
NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12839 Accepted: 4937 Special JudgeDescriptionAndrew is working as system administrator and is planning to establish a new net
2014-04-01 21:35:36
790
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人