其它~~~~~~~~~~~~~
文章平均质量分 63
martinue
攻城狮
展开
-
hdu 1394 (线段树推荐模板)
Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj.For a given sequence of numbers a1, a2, ..., an, if we mov原创 2015-06-03 22:01:23 · 422 阅读 · 0 评论 -
图的有关操作
1.键盘输入数据,建立一个有向图的邻接表。2.输出该邻接表。3.在有向图的邻接表的基础上计算各顶点的度,并输出。4.以有向图的邻接表为基础实现输出它的拓扑排序序列。5.采用邻接表存储实现无向图的深度优先非递归遍历。6.采用邻接表存储实现无向图的广度优先遍历。7.在主函数中设计一个简单的菜单,分别调试上述算法。#include #include #include #原创 2016-05-22 17:21:54 · 799 阅读 · 0 评论 -
树与二叉树的常见操作
实验内容: 1.输入字符序列,建立二叉链表。 2.前序,中序,后序遍历二叉树:递归算法。 3.中序遍历二叉树:非递归算法。 4.求二叉树的高度 。 5.求二叉树的叶子个数。 6.借助队列实现二叉树的层次遍历。 7.在主函数中设计一个简单的菜单,分别调试上述算法。#include #include #incl原创 2016-04-21 13:01:50 · 609 阅读 · 0 评论 -
栈和队列的有关操作
目的要求1.掌握栈、队列的思想及其存储实现。2.掌握栈、队列的常见算法的程序实现。实验内容1.采用链式存储实现栈的初始化、入栈、出栈操作。2.采用顺序存储实现栈的初始化、入栈、出栈操作。3.采用链式存储实现队列的初始化、入队、出队操作。4.采用顺序存储实现循环队列的初始化、入队、出队操作。5.在主函数中设计一个简单的菜单,分别测试上述算法。6. 利用栈实现数原创 2016-04-14 19:43:43 · 560 阅读 · 0 评论 -
线性表的有关操作
目的要求:⑴掌握单向链表的存储特点及其实现。⑵掌握单向链表的插入、删除算法及其应用算法的程序实现。实验内容:⑴随机产生或键盘输入一组元素,建立一个带头结点的单向链表(无序)。⑵遍历单向链表。⑶把单向链表中元素逆置(不允许申请新的结点空间)。⑷在单向链表中删除所有的偶数元素结点。⑸编写在非递减有序链表中插入一个元素使链表元素仍有序的函数,并利用该函数建立一个非递减有序原创 2016-04-08 09:31:05 · 506 阅读 · 0 评论 -
hdu(kmp的应用)
Problem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: Take me for example. I want to find out if I ha原创 2015-10-27 20:35:24 · 445 阅读 · 0 评论 -
AC自动机算法详解
说明转载出处:http://www.cppblog.com/mythit/archive/2009/04/21/80633.html感谢大牛的博客!!首先简要介绍一下AC自动机:Aho-Corasick automation,该算法在1975年产生于贝尔实验室,是著名的多模匹配算法之一。一个常见的例子就是给出n个单词,再给出一段包含m个字符的文章,让你找出有多少个单词在文章里出现过。要搞懂转载 2015-08-13 21:20:39 · 393 阅读 · 0 评论 -
hdu1247(trie树)
DescriptionA hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. You are to find all the hat’s words in a dictionary. In原创 2015-08-12 15:07:43 · 425 阅读 · 0 评论 -
hdu1251(trie树)
DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分原创 2015-08-12 14:45:46 · 617 阅读 · 0 评论 -
hdu1075(trie树)
DescriptionIgnatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now原创 2015-08-12 14:36:32 · 438 阅读 · 0 评论 -
hdu1671(trie树(字典树))
DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers: 1. Emergency 911原创 2015-08-12 14:28:29 · 572 阅读 · 0 评论 -
hdu1198(并查集的应用)
DescriptionBenny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a dif原创 2015-08-10 14:52:12 · 407 阅读 · 0 评论 -
hdu1558(并查集和简单几何的结合)
DescriptionA segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of segments in it. The problem is to find the size of some segment原创 2015-08-10 14:44:51 · 354 阅读 · 0 评论 -
poj1182(加权值的并查集)
Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述: 第一种说法是"1 X Y",表示X和Y是同类。 第二种说法是"2 X Y",表示X吃Y。 此人对N个原创 2015-08-10 14:25:49 · 374 阅读 · 0 评论 -
poj2492(加权值的并查集)
DescriptionBackgroundProfessor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of原创 2015-08-10 14:19:56 · 928 阅读 · 0 评论 -
poj1611(并查集)
Description严重急性呼吸系统综合症( SARS), 一种原因不明的非典型性肺炎,从2003年3月中旬开始被认为是全球威胁。为了减少传播给别人的机会, 最好的策略是隔离可能的患者。在Not-Spreading-Your-Sickness大学( NSYSU), 有许多学生团体。同一组的学生经常彼此相通,一个学生可以同时加入几个小组。为了防止非典的传播,NSYSU收集了所有学生团体原创 2015-08-10 14:06:35 · 347 阅读 · 0 评论 -
文件的输入输出的应用
1.使用字符输出流将一段文字存入文件,然后使用输入流读取文件中的内容。public class main { public static void main(String[] args) { File file = new File("hello.txt"); String s; Scanner r = new Scanner(System.in); s = r.nextLi原创 2016-05-04 19:37:38 · 671 阅读 · 0 评论 -
多线程的应用
实验内容1.设计5个人排队买票,并规定买票规则和排队顺序。public class TicketSeller{ //负责卖票的类 int fiveNumber=1,tenNumber=0,twentyNumber=0; public synchronized void sellTicket(int receiveMoney){ String原创 2016-04-28 17:06:10 · 1176 阅读 · 0 评论 -
实用类的使用
1.编写Application程序, 从命令行参数输入10个整数并保存在数组中,求数组中最大、最小、数据的和、平均值。public class Main { public static void main(String[] args) { int a[]=new int[10]; Scanner r=new Scanner(System.in); int max0 = 0,mi原创 2016-04-19 17:34:05 · 740 阅读 · 0 评论 -
类的继承和多态
1.设计一个抽象类,声明有关算术运算的方法,并创建四个子类继承该抽象的类,完成进行加、减、乘、除四则运算。publicabstract class calculate { public abstract double A(double a,doubleb);}public class addextends calculate{ public doub原创 2016-04-05 14:37:52 · 2007 阅读 · 0 评论 -
hdu5040(bfs,优先队列)
InstrusiveTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1578 Accepted Submission(s): 467Problem DescriptionThe legendary原创 2016-03-18 20:27:09 · 340 阅读 · 0 评论 -
hdu1010(dfs加剪枝)
Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He原创 2015-09-22 21:05:41 · 381 阅读 · 0 评论 -
hdu1428(spfa与记忆化搜索)
漫步校园Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3508 Accepted Submission(s): 1066Problem DescriptionLL最近沉迷于AC不能自拔,每天寝室、机房原创 2015-08-30 17:43:49 · 397 阅读 · 0 评论 -
hdu1372(最爱的广搜)
DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n square原创 2015-08-05 20:37:22 · 415 阅读 · 0 评论 -
poj3126(最爱的广搜)
DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. —原创 2015-08-05 20:33:48 · 421 阅读 · 0 评论 -
poj1426(深搜)
DescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater t原创 2015-08-05 20:26:52 · 581 阅读 · 0 评论 -
poj1321(深搜)
Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及原创 2015-08-05 20:23:17 · 395 阅读 · 0 评论 -
hdu2102(广搜)
Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主,因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚,告招天下勇士来拯救公主。不过公主早已习以为常,她深信智勇的骑士LJ肯定能将她救出。 现据密探所报,公主被关在一个两层的迷宫里,迷宫的入口是S(0,0,0),公主的位置用P表示原创 2015-08-05 19:55:22 · 707 阅读 · 0 评论 -
poj2828(线段树)
Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 15869 Accepted: 7905DescriptionRailway tickets were difficult to buy around the Lunar New Y原创 2015-08-07 17:24:40 · 377 阅读 · 0 评论 -
hdu 1754 I Hate It(线段树)
Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input本题目包含多组测试,请处理到文件结束。在每个测试的第一行,有两个正整数 N原创 2015-05-05 21:42:08 · 738 阅读 · 0 评论 -
二进制枚举(容斥原理)
The Sports Association of Bangladesh is in great problem with their latest lottery ‘Jodi laiga Jai’. Thereare so many participants this time that they cannot manage all the numbers. In an urgent mee原创 2015-08-02 10:09:43 · 1183 阅读 · 0 评论 -
fzu1752(坑!!!)
DescriptionGiven A,B,C, You should quickly calculate the result of A^B mod C. (1InputThere are multiply testcases. Each testcase, there is one line contains three integers A, B and C原创 2015-08-05 20:17:52 · 677 阅读 · 0 评论 -
hdu3117(斐波那契数列,矩阵连乘)
DescriptionThe Fibonacci sequence is the sequence of numbers such that every element is equal to the sum of the two previous elements, except for the first two elements f0 and f1 which are respect原创 2015-08-13 17:06:43 · 1362 阅读 · 0 评论 -
hdu1588(斐波那契,矩阵连乘)
Problem DescriptionWithout expecting, Angel replied quickly.She says: "I'v heard that you'r a very clever boy. So if you wanna me be your GF, you should solve the problem called GF~. "How good a原创 2015-09-08 21:41:40 · 504 阅读 · 0 评论 -
hdu2814(斐波那契,费马小定理,快速幂)
Problem DescriptionIn mathematics, the Fibonacci numbers are a sequence of numbers named after Leonardo of Pisa, known as Fibonacci (a contraction of filius Bonaccio, "son of Bonaccio"). Fibonacci原创 2015-09-09 21:10:23 · 546 阅读 · 0 评论 -
hdu3054(斐波那契。。。。找规律)
Problem DescriptionWe know the Fibonacci SequenceF1=1,F2=1,F3=2,F4=3,F5=5,...Fx = Fx-1+Fx-2We want to know the Mth number which has K consecutive "0" at the end of Fx.For examp原创 2015-09-10 20:19:38 · 981 阅读 · 0 评论 -
hdu4099(trie树,斐波那契数列)
Problem DescriptionThe well-known Fibonacci sequence is defined as following: Here we regard n as the index of the Fibonacci number F(n). This sequence has been studied since the publica原创 2015-09-14 20:15:06 · 871 阅读 · 0 评论 -
hdu1796(二进制枚举)
Problem Description Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For examp原创 2015-09-15 19:17:54 · 806 阅读 · 0 评论 -
hdu1018(求n!的位数)
Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you ar原创 2015-09-15 19:54:49 · 3922 阅读 · 4 评论 -
cf(思维题,判断两个大数的大小的比较方法)
C. The Big Racetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVector Willman and Array Bolt are the two mo原创 2015-11-03 21:09:33 · 1257 阅读 · 0 评论