自定义博客皮肤VIP专享

*博客头图:

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

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

博客底图:

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

栏目图:

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

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(58)
  • 收藏
  • 关注

原创 单链表按值操作

#include using namespace std;typedef struct Node{ int val; Node *next;}node;node* mycreat(int n){ node *head=NULL,*p=NULL,*sec=NULL; head=(node*)malloc(sizeof(node)); p=head; while (n--)

2013-08-19 11:20:27 646

原创 删除单链表中特定值

#includeusing namespace std;typedef struct Node { int val; Node *next;}LST;LST *mycreat(int n){ LST *head=NULL,*p=NULL,*sec=NULL; head=(LST*)malloc(sizeof(LST)); p=head; while(n--) { in

2013-08-19 11:18:08 610

原创 单链表中删除重复值

#include #include using namespace std;typedef struct Node{ int val,c; Node *next;}LST;int cmp(int a,int b){ return a<b?1:0;}LST *mycreat(int n){ int i=0,a[1001]; int t=n; while (t--)

2013-08-19 11:17:36 699

原创 单链表删除相同值

#include using namespace std;struct node{ int val,c; node *next; node() { c=0; }};node *mycreat(int n){ node *head=NULL,*p=NULL,*sec=NULL; head=(node*)malloc(sizeof(node)); p=head; wh

2013-08-19 11:16:40 618

原创 单链表排序

#include using namespace std;typedef struct Node { int val; Node *next;}LST;LST *mycreat(int n){ LST *head=NULL,*p=NULL,*sec=NULL; head=(LST*)malloc(sizeof(LST)); p=head; while(n--) { i

2013-08-19 11:15:54 479

原创 单链表连续删除

#includeusing namespace std;typedef struct Node { int val; Node *next;}LST;LST *mycreat(int n){ LST *p=NULL,*sec=NULL; LST *head=new LST; p=head; while(n--) { int v; scanf("%d",&v);

2013-08-19 11:15:19 811

原创 单链表的拆分

#include using namespace std;typedef struct Node{ char val; Node *next;}LST;LST *mycreat(LST *head,char v){ LST *p=new LST; LST *q=new LST; q=head; while(q->next) { q=q->next; } p->va

2013-08-19 11:14:33 643

原创 单链表按值操作

#include using namespace std;typedef struct Node{ int val; Node *next;}node;node* mycreat(int n){ node *head=NULL,*p=NULL,*sec=NULL; head=(node*)malloc(sizeof(node)); p=head; while (n--)

2013-08-19 11:02:19 633

原创 HDU2072 单词数 解题报告--set

单词数Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22195    Accepted Submission(s): 5379Problem Descriptionlily的好朋友xiaoou333最近很空,他想了

2013-08-15 21:46:00 558

原创 POJ3020 Antenna Placement 解题报告--匈牙利

Antenna PlacementTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5544 Accepted: 2777DescriptionThe Global Aerial Research Centre has been allotted the t

2013-08-14 19:08:28 475

原创 HDU1856 More is better 解题报告

More is betterTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 10251    Accepted Submission(s): 3778Problem DescriptionMr Wang want

2013-08-12 16:15:27 476

原创 HDU1213 How Many Tables 解题报告

How Many TablesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9387    Accepted Submission(s): 4635Problem DescriptionToday is Ignat

2013-08-12 16:07:50 474

原创 HDU1232 畅通工程 解题报告

畅通工程Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23065    Accepted Submission(s): 12020Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,

2013-08-12 16:00:59 502

原创 单链表操作

#includeusing namespace std;typedef struct Node{ int val; Node *next;}node;node* mycreat(int n){ node *head=NULL,*p=NULL,*sec=NULL; head=(node*)malloc(sizeof(node)); p=head; while(n--) {

2013-08-12 11:32:04 494

原创 HDU1507 Uncle Tom's Inherited Land* 解题报告--匈牙利

Uncle Tom's Inherited Land*Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1334    Accepted Submission(s): 572Special JudgeProblem Des

2013-08-12 09:42:38 490

原创 单链表的插入

#include using namespace std;typedef struct Node{ int val; Node *next;}node;node* mycreat(){ node *head=NULL,*p=NULL,*ne=NULL; head=(node*)malloc(sizeof(node)); p=head; int v;

2013-08-11 11:20:33 435

原创 单链表的复制

#include using namespace std;typedef struct Node{ double val; Node *next;}node;node* mycreat(double n){ node *head=NULL,*p=NULL,*sec=NULL; head=(node*)malloc(sizeof(node)); p=hea

2013-08-09 11:22:19 2402

原创 HDU1698 Just a Hook 解题报告--线段树

Just a HookTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12898    Accepted Submission(s): 6417Problem DescriptionIn the game of Do

2013-08-08 20:05:08 429

原创 HDU1556 Color the ball 解题报告--线段树

Color the ballTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6027    Accepted Submission(s): 3196Problem DescriptionN个气球排成一排,从左到右依次

2013-08-08 20:00:10 520

原创 单链表的遍历与长度计算

#include using namespace std;typedef struct Node{ int val; Node *next;}node;int sum;node* mycreat(int n){ node *head=NULL,*p=NULL,*ne=NULL; head=(node*)malloc(sizeof(node));

2013-08-08 11:31:01 1595

原创 单链表的建立和遍历

#include using namespace std;typedef struct Node { int count; struct Node *next;}node;node* mycreat(int n){ int val; node *head=NULL,*p=NULL,*ne=NULL; head=(node*)malloc(sizeof(n

2013-08-08 10:12:23 1336

原创 HDU3074 Multiply game 解题报告--线段树

Multiply gameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1171    Accepted Submission(s): 387Problem DescriptionTired of playing

2013-08-07 16:26:20 521

原创 HDU1754 I Hate It 解题报告--线段树

I Hate ItTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27077    Accepted Submission(s): 10747Problem Description很多学校流行一种比较的习惯。老师们很

2013-08-07 00:15:03 541

原创 HDU1166 敌兵布阵 解题报告--线段树

敌兵布阵Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30204    Accepted Submission(s): 12947Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以

2013-08-06 23:29:43 446

原创 HDU1671 Phone List 解题报告--字典树

Phone ListTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7202    Accepted Submission(s): 2471Problem DescriptionGiven a list of pho

2013-08-06 16:07:31 506

原创 HDU1247 Hat’s Words 解题报告--字典树

Hat’s WordsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5699    Accepted Submission(s): 2120Problem DescriptionA hat’s word is a

2013-08-06 12:58:00 435

原创 HDU1075 What Are You Talking About 解题报告--字典树

What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 10326    Accepted Submission(s): 3289Problem Description

2013-08-06 10:29:28 852

原创 HDU1251 统计难题 解题报告--字典树

统计难题Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 13618    Accepted Submission(s): 5835Problem DescriptionIgnatius最近遇到一个难题,老师交给他很

2013-08-05 21:06:02 497

原创 HDU1212 Big Number 解题报告

Big NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3830    Accepted Submission(s): 2635Problem DescriptionAs we know, Big Num

2013-08-04 19:54:37 448

原创 HDU1019 Least Common Multiple 解题报告

Least Common MultipleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23605    Accepted Submission(s): 8824Problem DescriptionThe lea

2013-08-04 19:43:14 386

原创 HDU1215 七夕节 解题报告

七夕节Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23867    Accepted Submission(s): 7382Problem Description七夕节那天,月老来到数字王国,他在城门上贴了一张告

2013-08-04 17:51:51 714

原创 HDU1042 N! 解题报告

N!Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43815    Accepted Submission(s): 12316Problem DescriptionGiven an integer N(0 ≤ N

2013-08-04 17:45:21 494

原创 ZOJ3501 Roman Order 解题报告

Roman OrderTime Limit: 2 Seconds                                    Memory Limit: 65536 KB                            Roman numerals are based on seven symbols: I = 1, V = 5, X = 10, L = 5

2013-08-04 17:37:33 530

原创 最短路,环经典题--根据网上资料整理

POJ 2449 Remmarguts' Date(中等)POJ 3013 - Big Christmas Tree(基础)POJ 3463 - Sightseeing(中等)POJ 3613 - Cow Relays(较难)POJ 3621 - Sightseeing Cows(中等)POJ 3635 - full tank?(中等)POJ 1236 - Network

2013-08-04 08:39:32 542

原创 POJ3259 Wormholes 解题报告--bellman_ford

WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 25153 Accepted: 8973DescriptionWhile exploring his many farms, Farmer John has discovered a num

2013-08-04 08:39:08 437

原创 HDU2680 Choose the best route 解题报告--Dijkstra

Choose the best routeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5249    Accepted Submission(s): 1669Problem DescriptionOne da

2013-08-04 08:38:41 429

原创 HDU3342 Legal or Not 解题报告--拓扑排序

Legal or NotTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3158    Accepted Submission(s): 1436Problem DescriptionACM-DIY is a larg

2013-08-03 20:47:26 554

原创 HDU1285 确定比赛名次 解题报告--拓扑排序

确定比赛名次Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8436    Accepted Submission(s): 3263Problem Description有N个比赛队(1 Input

2013-08-03 20:44:33 639

原创 HDU1596 find the safest road 解题报告--Dijkstra

find the safest roadTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4843    Accepted Submission(s): 1760Problem DescriptionXX星球有很多城

2013-08-03 20:35:27 375

原创 HDU1874 畅通工程续 解题报告--Dijkstra

畅通工程续Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19905    Accepted Submission(s): 6886Problem Description某省自从实行了很多年的畅通工程计划后,终于修建

2013-08-03 20:33:06 546

空空如也

空空如也

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

TA关注的人

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