上一页 1 ··· 39 40 41 42 43 44 45 46 47 ··· 94 下一页

2012年10月19日

ZOJ 3664 Split the Rectangle 第37届ACM/ICPC长春赛区现场赛 J 题(模拟建树,暴力 求LCA)

摘要: Split the RectangleTime Limit: 2 Seconds Memory Limit: 32768 KBAlice comes up with a new game and wants to play with Bob.There is one rectangle on the paper initially, we define its lower-left corner's coordinate is (xL, yL) and upper-right corner's coordinate is (xR, yR).Bob has executed th 阅读全文

posted @ 2012-10-19 13:54 kuangbin 阅读(1094) 评论(0) 推荐(0) 编辑

2012年10月17日

ZOJ 3662 Math Magic 第37届ACM/ICPC长春赛区H题(DP)

摘要: Math MagicTime Limit: 3 Seconds Memory Limit: 32768 KBYesterday, my teacher taught us about math: +, -, *, /, GCD, LCM... As you know, LCM (Least common multiple) of two positive numbers can be solved easily because of a * b = GCD (a, b) * LCM (a, b).In class, I raised a new idea: "how to calcu 阅读全文

posted @ 2012-10-17 13:35 kuangbin 阅读(1398) 评论(0) 推荐(0) 编辑

ZOJ 3659 Conquer a New Region 第37届ACM/ICPC 长春赛区现场赛E题 (并查集)

摘要: Conquer a New RegionTime Limit: 5 Seconds Memory Limit: 32768 KBThe wheel of the history rolling forward, our king conquered a new region in a distant continent.There are N towns (numbered from 1 to N) in this region connected by several roads. It's confirmed that there is exact one route betwee 阅读全文

posted @ 2012-10-17 08:54 kuangbin 阅读(1323) 评论(0) 推荐(0) 编辑

2012年10月16日

【原创】2012ACM长春赛区现场赛总结

摘要: 2012年ACM长春赛区区域赛结束了,这是今年的第一场区域赛。也意味着我今年在国内的比赛结束了(下一个赛区是去泰国的赛区)先记一下流水账:10月12日: 11:30的飞机去长春,8:00就开始出发去机场了。坐了两个多小时的飞机,感觉很爽。到了长春打车1个小时到了东师会馆注册、领衣服、抽签~~~~~然后入住了五星级宾馆——海航名门饭店。五星级的也就这样吧,没有感觉很好。但是服务和早餐真的很棒啊,有么有!10月13日:6点多就醒来了,然后就一直睡不着了。。。等待所有人都起来后,8点多去吃早餐,真的是暴豪华的早餐啊~~然后就去周边逛了下。去看了满洲国务院,去了文化广场。然后回到东北师范大学去吃午餐了 阅读全文

posted @ 2012-10-16 18:30 kuangbin 阅读(2887) 评论(8) 推荐(3) 编辑

ZOJ 3665 Yukari's Birthday 第37届ACM/ICPC长春赛区现场赛K题 (水题,枚举,二分)

摘要: Yukari's BirthdayTime Limit: 2 Seconds Memory Limit: 32768 KBToday is Yukari's n-th birthday. Ran and Chen hold a celebration party for her. Now comes the most important part, birthday cake! But it's a big challenge for them to place n candles on the top of the cake. As Yukari has lived 阅读全文

posted @ 2012-10-16 12:29 kuangbin 阅读(1604) 评论(7) 推荐(0) 编辑

ZOJ 3657 The Little Girl who Picks Mushrooms 第37届ACM/ICPC长春赛区现场赛C题(水题)

摘要: The Little Girl who Picks MushroomsTime Limit: 2 Seconds Memory Limit: 32768 KBIt's yet another festival season in Gensokyo. Little girl Alice planned to pick mushrooms in five mountains. She brought five bags with her and used different bags to collect mushrooms from different mountains. Each b 阅读全文

posted @ 2012-10-16 11:07 kuangbin 阅读(1368) 评论(2) 推荐(0) 编辑

ZOJ 3656 Bit Magic 第37届ACM/ICPC长春赛区现场赛B题 (2-SAT)

摘要: Bit MagicTime Limit: 8 Seconds Memory Limit: 32768 KBYesterday, my teacher taught me about bit operators: and (&), or (|), xor (^). I generated a number table a[N], and wrote a program to calculate the matrix table b[N][N] using three kinds of bit operator. I thought my achievement would get tea 阅读全文

posted @ 2012-10-16 10:50 kuangbin 阅读(1687) 评论(7) 推荐(0) 编辑

2012年10月7日

【转】【伸展树Splay Tree】

摘要: 作者:Dong | 可以转载, 但必须以超链接形式标明文章原始出处和作者信息及版权声明网址:http://dongxicheng.org/structure/splay-tree/1、 概述二叉查找树(Binary Search Tree,也叫二叉排序树,即Binary Sort Tree)能够支持多种动态集合操作,它可以用来表示有序集合、建立索引等,因而在实际应用中,二叉排序树是一种非常重要的数据结构。从算法复杂度角度考虑,我们知道,作用于二叉查找树上的基本操作(如查找,插入等)的时间复杂度与树的高度成正比。对一个含n个节点的完全二叉树,这些操作的最坏情况运行时间为O(log n)。但如果因 阅读全文

posted @ 2012-10-07 15:21 kuangbin 阅读(7662) 评论(4) 推荐(0) 编辑

HDU 4115 Eliminate the Conflict (2-SAT)

摘要: Eliminate the ConflictTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 740Accepted Submission(s): 301Problem DescriptionConflicts are everywhere in the world, from the young to the elderly, from families to countries. Conflicts cause quarrels, fight 阅读全文

posted @ 2012-10-07 13:46 kuangbin 阅读(1333) 评论(1) 推荐(0) 编辑

POJ 3678 Katu Puzzle (2-SAT)

摘要: Katu PuzzleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5749Accepted: 2077DescriptionKatu Puzzle is presented as a directed graph G(V, E) with each edge e(a, b) labeled by a boolean operator op (one of AND, OR, XOR) and an integer c (0 ≤ c ≤ 1). One Katu is solvable if one can find each 阅读全文

posted @ 2012-10-07 10:54 kuangbin 阅读(367) 评论(0) 推荐(0) 编辑

上一页 1 ··· 39 40 41 42 43 44 45 46 47 ··· 94 下一页

导航

JAVASCRIPT: