自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

Prim

我不是Prim

  • 博客(33)
  • 资源 (1)
  • 收藏
  • 关注

原创 智障租车(JAVA小项目)

慕课网JAVA第二季最后留的小作业http://www.imooc.com/video/3334源码存一下,留到若干年以后笑笑自己package Prim;//汽车父类public class Car { private String CarName; private double CarPrice; public String getCarName() {

2016-08-30 14:45:04 1083

原创 JAVA开发环境搭建(JDK JRE Eclipse汉化 GUI插件)

以下内容我用win10_X64测试的一:下载JDK文件链接:http://pan.baidu.com/s/1geH8rqN 密码:vlh4 然后疯狂下一步,直至安装完毕,假设安装到了C:\Program Files\Java(安装路径是自定义的,配置环境变量时需要这些路径信息)二:配置环境变量,按步骤打开:控制面板→所有控制面板项→系统→高级系统设置→环境变量。系统变量下点击新建,输入变量名JAV

2016-08-28 23:19:55 2193

原创 C/C++环境搭建(CodeBlocks)(献给不会HelloWorld的童鞋)

献给不会HelloWorld的童鞋一:下载压缩包,然后解压得到code blocks文件夹 链接:http://pan.baidu.com/s/1eSbnd0A 密码:1lpr二:进入code blocks文件夹,双击codeblocks-13.12mingw-setup.exe疯狂下一步,直至安装成功,中间记得自己的安装路径,假设安装到了F:\CodeBlocks。三:将解压缩得到的code b

2016-08-28 22:19:48 7256

原创 POJ-1273-Drainage Ditches(网络最大流 标号法)

Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 69828 Accepted: 27070 DescriptionEvery time it rains on Farmer John’s fields, a pond forms over Bessie’s favor

2016-08-22 20:07:07 565

原创 POJ-1149-PIGS(最大流 标号法)

PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20033 Accepted: 9179 DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can’t unlock any

2016-08-16 10:45:08 702

原创 网络最大流模板(标号法)

测试数据 6 10 0 1 8 2 0 2 4 3 1 3 2 2 1 4 2 2 2 1 4 2 2 3 1 1 2 4 4 0 3 4 6 0 3 5 9 3 4 5 7 20->1:4 0->2:4 1->3:2 1->4:2 2->1:0 2->3:1 2->4:3 3->4:0 3->5:3 4->5:5 max_flow=8代码#include<

2016-08-15 14:43:55 2536

原创 ZZULIOJ-1913-小火山的计算能力(模拟)

1913: 小火山的计算能力Time Limit: 1 Sec Memory Limit: 128 MB Submit: 482 Solved: 125SubmitStatusWeb Board Description别人说小火山的计算能力不行,小火山很生气,于是他想证明自己,现在有一个表达式,他想计算出来。Input首先是一个t(1<=20)表示测试组数。然后一个表达式,表达式长度不超过2

2016-08-11 10:51:22 382

原创 POJ-3259-Wormholes(SPFA 链表建立邻接表)

Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 44217 Accepted: 16262 DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormh

2016-08-11 10:46:26 505

原创 POJ-3268-Silver Cow Party(SPFA 反向建图)

Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18662 Accepted: 8536 DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is goin

2016-08-11 09:05:37 404

原创 POJ-2240-Arbitrage(弗洛伊德|贝尔曼)

Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20786 Accepted: 8859 DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one uni

2016-08-10 16:10:00 342

原创 POJ-1511-Invitation Cards(SPFA 反向建图)

Invitation Cards Time Limit: 8000MS Memory Limit: 262144K Total Submissions: 25160 Accepted: 8325 DescriptionIn the age of television, not many people attend theater performances. Antiqu

2016-08-10 14:55:31 354

原创 POJ-1122-FDNY to the Rescue!(迪杰斯特拉 反向建图 输出路径)

FDNY to the Rescue! Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2952 Accepted: 908 DescriptionThe Fire Department of New York (FDNY) has always been proud of their response t

2016-08-10 09:51:17 834

原创 2016HDU多校联赛-HDU-5813-Elegant Construction(构造联通图)

Elegant ConstructionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 301 Accepted Submission(s): 158 Special JudgeProblem Description Being

2016-08-10 08:52:59 376

原创 2016HDU多校联赛-HDU-Joint Stacks(模拟)

Joint StacksTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 390 Accepted Submission(s): 171Problem Description A stack is a data structure

2016-08-09 21:06:28 403

原创 POJ-1135-Domino Effect(迪杰斯特拉)

Domino Effect Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10713 Accepted: 2655 DescriptionDid you know that you can use domino bones for other things besides playing Domin

2016-08-08 17:49:11 346

原创 POJ-1287-Networking(克鲁斯卡尔)

Networking Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8729 Accepted: 4832 DescriptionYou are assigned to design network connections between certain points in a wide area. Yo

2016-08-08 11:30:20 280

原创 POJ-1251-Jungle Roads(克鲁斯卡尔)

Jungle Roads Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 24050 Accepted: 11282 DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of fore

2016-08-08 11:07:29 248

原创 POJ-1861-Network(克鲁斯卡尔)

Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 16071 Accepted: 6369 Special Judge DescriptionAndrew is working as system administrator and is planning to establi

2016-08-08 10:46:07 296

原创 HDU-2091-空心三角形(输入输出控制)

空心三角形Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 37837 Accepted Submission(s): 10404Problem Description 把一个字符三角形掏空,就能节省材料成本,减轻重量,但关键是为了

2016-08-06 09:35:41 383

原创 HDU-2160-母猪的故事(斐波那契数列)

母猪的故事Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9584 Accepted Submission(s): 5951Problem Description 话说现在猪肉价格这么贵,著名的ACBoy 0068 也开始了养猪生

2016-08-06 09:32:45 1241

原创 LightOJ-1245-Harmonic Number (II)

1245 - Harmonic Number (II) PDF (English) Statistics Forum Time Limit: 3 second(s) Memory Limit: 32 MB I was trying to solve problem ‘1234 - Harmonic Number’, I wrote the following codelo

2016-08-06 09:23:19 634

原创 POJ-2709-Painter(贪心)

Painter Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4495 Accepted: 2624 DescriptionThe local toy store sells small fingerpainting kits with between three and twelve 50ml bott

2016-08-06 09:17:17 427

原创 UVA-11624-Fire!(多点BFS)

Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the

2016-08-06 09:14:28 273

原创 POJ-3984-迷宫问题(BFS打印路径)

迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16009 Accepted: 9551 Description定义一个二维数组: int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0,

2016-08-06 09:07:39 526

原创 POJ-1979-Red and Black(DFS)

Red and Black Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 30891 Accepted: 16825 DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored eit

2016-08-05 09:47:32 420 2

原创 POJ-1562-Oil Deposits(DFS)

Oil Deposits Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 16233 Accepted: 8738 DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground o

2016-08-05 09:12:50 315

原创 NYOJ-42-一笔画问题(欧拉路 判图联通)

一笔画问题 时间限制:3000 ms | 内存限制:65535 KB 难度:4 描述 zyc从小就比较喜欢玩一些小游戏,其中就包括画一笔画,他想请你帮他写一个程序,判断一个图是否能够用一笔画下来。 规定,所有的边都只能画一次,不能重复画。 输入 第一行只有一个正整数N(N<=10)表示测试数据的组数。 每组测试数据的第一行有两个正整数P,Q(P<=1000,Q<=2000),分别

2016-08-04 14:52:07 558

原创 UVALive-7350-ACM Contest Scoring(模拟)

Our new contest submission system keeps a chronological log of all submissions made by each team during the contest. With each entry, it records the number of minutes into the competition at which th

2016-08-04 14:24:20 349

原创 NYOJ-20-吝啬的国度(树的先序遍历)

吝啬的国度 时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述 在一个吝啬的国度里有N个城市,这N个城市间只有N-1条路把这个N个城市连接起来。现在,Tom在第S号城市,他有张该国地图,他想知道如果自己要去参观第T号城市,必须经过的前一个城市是几号城市(假设你不走重复的路)。 输入 第一行输入一个整数M表示测试数据共有M(1<=M<=5)组 每组测试数据的第一

2016-08-04 08:53:18 479

原创 ZZULIOJ-1898-985的数字难题(水题)

1898: 985的数字难题Time Limit: 1 Sec Memory Limit: 128 MB Submit: 255 Solved: 84SubmitStatusWeb Board Description985有n个数,已知每次操作可以将其中不相同的两个数一个加一、一个减一,操作次数不限。 问他最多可以得到多少个相同的数。 Input第一行输入一个整数t,代表有t组测试数据。

2016-08-03 18:27:09 347

原创 ZZULIOJ-1896-985的买饮料难题(水题)

1896: 985的买饮料难题Time Limit: 1 Sec Memory Limit: 128 MB Submit: 221 Solved: 118SubmitStatusWeb Board Description天气太热了,985制定了对未来的规划即第i天喝a[i]瓶饮料。为了节约开支,他打听到了第i天每瓶饮料的价格p[i]。 为了不让自己的规划落空,他想知道这n天他至少要花多少钱

2016-08-03 18:14:51 462

原创 ZZULIOJ-1894-985的方格难题(动态规划)

1894: 985的方格难题Time Limit: 1 Sec Memory Limit: 128 MB Submit: 329 Solved: 62SubmitStatusWeb Board Description985走入了一个n * n的方格地图,他已经知道其中有一个格子是坏的。现在他要从(1, 1)走到(n, n),每次只可以向下或者向右走一步,问他能否到达(n,n)。若不能到达输出

2016-08-03 18:12:50 465

原创 UVALive-7470-Easy Problemset(模拟)

Perhaps one of the hardest problems of any ACM ICPC contest is to create a problemset with a reasonable number of easy problems. On Not Easy European Regional Contest this problem is solved as follow

2016-08-03 14:56:50 511

《数据结构》算法实现及解析[第二版]高一凡

数据结构课本的电子版

2016-03-19

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除