点点滴滴”

导航

08 2014 档案

poj 1936 All in All
摘要：All in AllTime Limit: 1000 MS Memory Limit: 30000 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descriptio... 阅读全文

posted @ 2014-08-31 14:53 点点滴滴” 阅读(190) 评论(0) 推荐(0)

poj 1035 Spell checker
摘要：Spell checkerTime Limit: 2000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descrip... 阅读全文

posted @ 2014-08-31 13:36 点点滴滴” 阅读(179) 评论(0) 推荐(0)

poj 3259 Wormholes 判断负权值回路
摘要：WormholesTime Limit: 2000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Description... 阅读全文

posted @ 2014-08-31 09:37 点点滴滴” 阅读(184) 评论(0) 推荐(0)

HDU 2019 数列有序!
摘要：Time Limit: 1000 MS Memory Limit: 32768 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Description有n(n#incl... 阅读全文

posted @ 2014-08-28 18:57 点点滴滴” 阅读(185) 评论(0) 推荐(0)

单链表 结构体存储方式
摘要：http://wenku.baidu.com/link?url=tStuDo3VFhPDrGFnBWdhAWBeCPJSgfxMvNqOR5pnejuZ1UifCv5sYik5z1JBnr8t4Lwh4Y_1pRJYlLQVSoJX4QJn9-EwsREsmxbidx7W9gahttp://mysw... 阅读全文

posted @ 2014-08-28 18:45 点点滴滴” 阅读(214) 评论(0) 推荐(0)

poj 1556 The Doors
摘要：The DoorsTime Limit: 1000 MS Memory Limit: 10000 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Description... 阅读全文

posted @ 2014-08-27 20:45 点点滴滴” 阅读(141) 评论(0) 推荐(0)

poj 2240 Arbitrage
摘要：Time Limit: 1000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]DescriptionArbitrage... 阅读全文

posted @ 2014-08-26 19:36 点点滴滴” 阅读(151) 评论(0) 推荐(0)

poj 2251 Dungeon Master
摘要：#include #include #include #include using namespace std;#define maxx 45char map[maxx][maxx][maxx];int vis[maxx][maxx][maxx];int dir[6][3]={{1,0,0},{-1... 阅读全文

posted @ 2014-08-25 20:56 点点滴滴” 阅读(161) 评论(0) 推荐(0)

poj 3083 Children of th
摘要：#include #include#includeusing namespace std;int n,m;int r[4][2]= {{0,-1},{1,0},{0,1},{-1,0}};int l[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};int vis[50][50]... 阅读全文

posted @ 2014-08-25 19:05 点点滴滴” 阅读(134) 评论(0) 推荐(0)

A - Excellent Team
摘要：Description Gibbs: Next! First Pirate: My wife ran off with my dog and I'm drunk for a month. Gibbs: Perfect. Next! Second Pirate: Me hav... 阅读全文

posted @ 2014-08-23 10:54 点点滴滴” 阅读(255) 评论(0) 推荐(0)

E - Tears of Drowned
摘要：Description Tia Dalma: Come. What service may I do you? You know I demand payment. Jack: I brought payment. Look. An undead monkey. Top that. T... 阅读全文

posted @ 2014-08-23 10:03 点点滴滴” 阅读(185) 评论(0) 推荐(0)

B - Big String
摘要：We will construct an infinitely long string from two short strings: A = "^__^" (four characters), and B = "T.T" (three characters). Repeat the followi... 阅读全文

posted @ 2014-08-20 14:52 点点滴滴” 阅读(172) 评论(0) 推荐(0)

E - Evaluate Matrix Sum
摘要：DescriptionGiven a matrix, the elements of which are all integer number from 0 to 50, you are required to evaluate the square sum of its specified sub... 阅读全文

posted @ 2014-08-20 13:03 点点滴滴” 阅读(248) 评论(0) 推荐(0)

I - Dividing Stones
摘要：DescriptionThere are N stones, which can be divided into some piles arbitrarily. Let the value of each division be equal to the product of the number ... 阅读全文

posted @ 2014-08-20 12:32 点点滴滴” 阅读(184) 评论(0) 推荐(0)

F - Cookies Piles
摘要：DescriptionThe kids in my son's kindergarten made Christmas cookies with their teacher, and piled them up in columns. They then arranged the columns s... 阅读全文

posted @ 2014-08-20 11:19 点点滴滴” 阅读(203) 评论(0) 推荐(0)

G - Christmas Play
摘要：DescriptionMy kid's kindergarten class is putting up a Christmas play. (I hope he gets the lead role.) The kids are all excited, but the teacher has a... 阅读全文

posted @ 2014-08-20 10:22 点点滴滴” 阅读(180) 评论(0) 推荐(0)

A - Playground
摘要：My kid's school cleared a large field on their property recently to convert it into a playing area. The field is polygonal. The school administration ... 阅读全文

posted @ 2014-08-20 10:14 点点滴滴” 阅读(254) 评论(0) 推荐(0)

B - Avoiding a disaster
摘要：DescriptionPercy likes to be punctual. So much so that he always keeps three watches with him, so that he can be sure exactly what the time is. Howeve... 阅读全文

posted @ 2014-08-19 10:33 点点滴滴” 阅读(398) 评论(0) 推荐(0)

J - Oil Skimming 二分图的最大匹配
摘要：DescriptionThanks to a certain "green" resources company, there is a new profitable industry of oil skimming. There are large slicks of crude oil floa... 阅读全文

posted @ 2014-08-19 09:23 点点滴滴” 阅读(203) 评论(0) 推荐(0)

C - Roll-call in Woop Woop High
摘要：DescriptionThe new principal of Woop Woop High is not satisfied with her pupils performance. She introduced a new roll-call process to get a daily mea... 阅读全文

posted @ 2014-08-18 17:08 点点滴滴” 阅读(237) 评论(0) 推荐(0)

A - Class Statistics
摘要：A - Class Statistics Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVALive 5682Description ///最开始 没有读懂 Largest... 阅读全文

posted @ 2014-08-18 17:07 点点滴滴” 阅读(196) 评论(0) 推荐(0)

poj 1129 搜索
摘要：Channel AllocationTime Limit: 1000 MS Memory Limit: 10000 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]De... 阅读全文

posted @ 2014-08-18 11:52 点点滴滴” 阅读(158) 评论(0) 推荐(0)

poj 2676 如何填满九宫格
摘要：SudokuTime Limit: 2000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: MainSpecial Judge[Submit] [Status] [Discuss]D... 阅读全文

posted @ 2014-08-18 08:52 点点滴滴” 阅读(268) 评论(0) 推荐(0)

G 最水的一道
摘要：G - Here Be DragonsThe Triwizard Tournament's third task is to negotiate a corridor of many segmen... 阅读全文

posted @ 2014-08-17 16:11 点点滴滴” 阅读(176) 评论(0) 推荐(0)

poj 2531 搜索剪枝
摘要：Network SaboteurTime Limit: 2000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Desc... 阅读全文

posted @ 2014-08-17 11:45 点点滴滴” 阅读(227) 评论(0) 推荐(0)

poj 1837 01背包
摘要：BalanceTime Limit: 1000 MS Memory Limit: 30000 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]DescriptionGi... 阅读全文

posted @ 2014-08-13 10:40 点点滴滴” 阅读(122) 评论(0) 推荐(0)

HDU 1465 2045 已知结果往前推
摘要：1465不容易系列之一Time Limit: 1000 MS Memory Limit: 32768 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descripti... 阅读全文

posted @ 2014-08-13 09:23 点点滴滴” 阅读(233) 评论(0) 推荐(0)

poj 3264 区间最大最小值 RMQ问题之Sparse_Table算法
摘要：Balanced LineupTime Limit: 5000 MS Memory Limit: 0 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descripti... 阅读全文

posted @ 2014-08-12 10:29 点点滴滴” 阅读(291) 评论(0) 推荐(0)

poj 3321 单点更新 区间求和
摘要：Apple TreeTime Limit: 2000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descriptio... 阅读全文

posted @ 2014-08-11 15:43 点点滴滴” 阅读(144) 评论(0) 推荐(0)

poj 1195 单点更新 区间求和
摘要：Mobile phonesTime Limit: 5000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descrip... 阅读全文

posted @ 2014-08-11 10:40 点点滴滴” 阅读(141) 评论(0) 推荐(0)

poj 2155 区间更新 单点查询
摘要：MatrixTime Limit: 3000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]DescriptionGiv... 阅读全文

posted @ 2014-08-11 09:56 点点滴滴” 阅读(133) 评论(0) 推荐(0)

HDU 1556 区间查询
摘要：Color the ballTime Limit: 3000 MS Memory Limit: 32768 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descri... 阅读全文

posted @ 2014-08-11 09:14 点点滴滴” 阅读(142) 评论(0) 推荐(0)

HRBUST 1161 树状数组区间更新求和
摘要：http://blog.csdn.net/shahdza/article/details/6314818 阅读全文

posted @ 2014-08-10 18:51 点点滴滴” 阅读(197) 评论(0) 推荐(0)

map 小模板~~~ 写的不好 继续添加
摘要：#include#include#includeusing namespace std;int main(){ ///map插入 map mp; /// mp["a"]=1; mp["b"]=2; mp["c"]=3; map::iterator it; for(it=mp.begin(); it!... 阅读全文

posted @ 2014-08-09 17:20 点点滴滴” 阅读(177) 评论(0) 推荐(0)

POJ 2570 线段树
摘要：Potted FlowerTime Limit: 2000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descrip... 阅读全文

posted @ 2014-08-09 10:44 点点滴滴” 阅读(154) 评论(0) 推荐(0)

poj2828 线段树单点更新
摘要：Buy TicketsTime Limit: 4000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descripti... 阅读全文

posted @ 2014-08-08 10:41 点点滴滴” 阅读(103) 评论(0) 推荐(0)

HDU 4920 矩阵乘积 优化
摘要：Matrix multiplicationTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1289Accepted Submission(s):... 阅读全文

posted @ 2014-08-06 09:21 点点滴滴” 阅读(228) 评论(0) 推荐(0)

分治 赛程安排
摘要：问题描述：有n个运动员进行循环赛，要求设计满足一下要求的日程表1、 每两人必须比赛一次且只比赛一次2、 每个选手每天只能比赛一次3、 要求比赛时间尽可能短（即n为偶数时比赛n-1天，n为奇数时比赛n天）一、分治法算法思想，先算n/2的日程表，然后将循环赛日程表左上复制到右下，左下复制到右上，得到n的... 阅读全文

posted @ 2014-08-05 09:55 点点滴滴” 阅读(334) 评论(0) 推荐(0)

poj 2886 线段树的更新+反素数
摘要：Who Gets the Most Candies?Time Limit: 5000 MS Memory Limit: 0 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discus... 阅读全文

posted @ 2014-08-04 16:49 点点滴滴” 阅读(244) 评论(0) 推荐(0)

poj 2777 线段树的区间更新
摘要：Count ColorTime Limit: 1000 MS Memory Limit: 65536 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discuss]Descripti... 阅读全文

posted @ 2014-08-01 18:36 点点滴滴” 阅读(169) 评论(0) 推荐(0)

00000
摘要：#include#include#include#include#define MAX 20001using namespace std;int c,n,ls[MAX];struct node{ int l,r; int c;} tr[MAX*4];struct ln{ int li,num;//n... 阅读全文

posted @ 2014-08-01 15:42 点点滴滴” 阅读(796) 评论(0) 推荐(0)