随笔分类 -  数据结构

上一页 1 2 3 4 下一页

HDUOJ--------A simple stone game（尼姆博弈扩展)(2008北京现场赛A题）
摘要：A simple stone gameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 312Accepted Submission(s): 16... 阅读全文

posted @ 2014-05-25 23:58 龚细军 阅读(582) 评论(0) 推荐(0)

HDUOJ---1754 Minimum Inversion Number （单点更新之求逆序数）
摘要：Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9342Accepted Submission(s)... 阅读全文

posted @ 2014-04-26 10:16 龚细军 阅读(267) 评论(0) 推荐(0)

HDUOJ-------1753大明A+B（大数之小数加法）
摘要：大明A+BTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7545Accepted Submission(s): 2662Problem Descr... 阅读全文

posted @ 2014-04-26 01:12 龚细军 阅读(401) 评论(0) 推荐(0)

HDUOJ---1754 I Hate It （线段树之单点更新查区间最大值）
摘要：I Hate ItTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33469Accepted Submission(s): 13168Problem... 阅读全文

posted @ 2014-04-24 17:09 龚细军 阅读(327) 评论(0) 推荐(0)

HDUOJ----1166敌兵布阵（线段树单点更新）
摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37270Accepted Submission(s): 15723Problem Desc... 阅读全文

posted @ 2014-04-23 22:57 龚细军 阅读(278) 评论(0) 推荐(0)

poj----2155 Matrix(二维树状数组第二类)
摘要：MatrixTime Limit:3000MSMemory Limit:65536KTotal Submissions:16950Accepted:6369DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i,... 阅读全文

posted @ 2014-04-20 14:30 龚细军 阅读(235) 评论(0) 推荐(0)

最大堆最小堆总结
摘要：何为堆，我们知道有一个堆排序，那我们先讲讲这个堆排序吧！... 阅读全文

posted @ 2014-04-19 22:35 龚细军 阅读(159) 评论(0) 推荐(0)

poj------2352 Stars（树状数组）
摘要：StarsTime Limit:1000MSMemory Limit:65536KTotal Submissions:30268Accepted:13202DescriptionAstronomers often examine star maps where stars are represent... 阅读全文

posted @ 2014-04-19 16:20 龚细军 阅读(475) 评论(3) 推荐(0)

HDUOJ-----2852 KiKi's K-Number（树状数组+二分）
摘要：KiKi's K-NumberTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2393Accepted Submission(s): 1101Pro... 阅读全文

posted @ 2014-04-19 13:05 龚细军 阅读(213) 评论(0) 推荐(0)

nyoj----522 Interval （简单树状数组）
摘要：Interval时间限制：2000ms | 内存限制：65535KB难度：4描述There are n(1 2 #include 3 #include 4 #define maxn 200005 //整体平移100001个单位 5 #define lowbit(x) ((x)&(-x)) 6 ... 阅读全文

posted @ 2014-04-18 22:12 龚细军 阅读(264) 评论(0) 推荐(0)

HDUOJ-----2838Cow Sorting（组合树状数组）
摘要：Cow SortingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2163Accepted Submission(s): 671Problem ... 阅读全文

posted @ 2014-04-17 23:21 龚细军 阅读(284) 评论(0) 推荐(0)

poj-----Ultra-QuickSort(离散化+树状数组)
摘要：Ultra-QuickSortTime Limit:7000MSMemory Limit:65536KTotal Submissions:38258Accepted:13784DescriptionIn this problem, you have to analyze a particular s... 阅读全文

posted @ 2014-04-15 14:57 龚细军 阅读(280) 评论(0) 推荐(0)

HDUOJ---1241Oil Deposits(dfs)
摘要：Oil DepositsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10644Accepted Submission(s): 6176Probl... 阅读全文

posted @ 2014-04-13 23:07 龚细军 阅读(261) 评论(0) 推荐(0)

HDUOJ---携程员工运动会场地问题
摘要：携程员工运动会场地问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 821Accepted Submission(s): 231Problem D... 阅读全文

posted @ 2014-04-13 21:09 龚细军 阅读(390) 评论(0) 推荐(0)

HDUOJ---3743Frosh Week（BIT+离散化）
摘要：Frosh WeekTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1545Accepted Submission(s): 497Problem DescriptionDuring Frosh Week, students play various fun games to get to know each other and compete against other teams. In one such game, all the fros 阅读全文

posted @ 2014-04-08 23:18 龚细军 阅读(228) 评论(0) 推荐(0)

HUDOJ-----1394Minimum Inversion Number
摘要：Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9163Accepted Submission(s): 5642Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj.For a give. 阅读全文

posted @ 2014-04-07 17:51 龚细军 阅读(387) 评论(0) 推荐(0)

HDUOJ-----1166敌兵布阵
摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36506Accepted Submission(s): 15432Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人 阅读全文

posted @ 2014-04-07 12:57 龚细军 阅读(218) 评论(0) 推荐(0)

HDUOJ----2487Ugly Windows
摘要：Ugly WindowsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1199Accepted Submission(s): 467Problem DescriptionSheryl works for a software company in the country of Brada. Her job is to develop a Windows operating system. People in Brada are incredi 阅读全文

posted @ 2014-04-04 14:46 龚细军 阅读(247) 评论(0) 推荐(0)

HDUOJ -----1864 最大报销额(动态规划)
摘要：最大报销额Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14966Accepted Submission(s): 4235Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书（A类）、文具（B类）、差旅（C类），要求每张发票的总额不得超过1000元，每张发票上，单项物品的价值不得超过600元。现请你编写程序，在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。Input测试输入包含若 阅读全文

posted @ 2014-04-03 14:24 龚细军 阅读(637) 评论(0) 推荐(0)

排序一栏（总结帖）
摘要：学了很多的排序，基数排序，堆排序，希尔排序，选择排序，归并排序，快速排序，冒泡排序.....等等，尽管网上好文，如堆山之牛毛，但是还是没有自己写，来的亲切，因而唠叨数语，为以后只闲暇，积累一些看资,也仅以自己娱乐罢了，大神等，尽可鄙视之，我等小子亦是荣幸万分！ 大学，我们接触的第一种排序，便是冒泡排序，那么冒泡排序的原理是什么勒？ 哎，太基础啦，挫 比如一组数字 1 /*归并排序递归版 2 Coder @ Gxjun 3 2014/3/30/16:42 4 */ 5 #include 6 #include 7 #include 8 void merge(int A[],int lo... 阅读全文

posted @ 2014-03-30 22:44 龚细军 阅读(427) 评论(0) 推荐(0)

上一页 1 2 3 4 下一页