自定义博客皮肤VIP专享

*博客头图:

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

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

博客底图:

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

栏目图:

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

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(43)
  • 资源 (1)
  • 收藏
  • 关注

原创 HDU5073 ACM-ICPC亚洲区域赛鞍山赛区现场赛D题 Galaxy 贪心+数学推导

GalaxyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1396    Accepted Submission(s): 317Special JudgeProblem DescriptionGood

2014-10-27 19:57:56 1816 4

原创 HDU5074 ACM-ICPC亚洲区域赛鞍山赛区现场赛E题 Hatsune Miku 二维DP

Hatsune MikuTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 318    Accepted Submission(s): 238Problem DescriptionHatsune Miku

2014-10-27 18:18:20 1435 1

原创 HDU5078 2014 ACM-ICPC亚洲区域赛鞍山赛区现场赛I题 Osu! 签到题

Osu!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 392    Accepted Submission(s): 230Special JudgeProblem DescriptionOsu! is

2014-10-27 16:39:54 1408

原创 ZOJ3829 ACM-ICPC 2014 亚洲区域赛牡丹江赛区现场赛K题 Known Notation 贪心

Known NotationTime Limit: 2 Seconds      Memory Limit: 131072 KBDo you know reverse Polish notation (RPN)? It is a known notation in the area of mathematics and computer science. It is also kn

2014-10-13 16:41:24 1873 2

原创 ZOJ3822 ACM-ICPC 2014 亚洲区域赛牡丹江赛区现场赛D题Domination 概率DP

DominationTime Limit: 8 Seconds      Memory Limit: 131072 KB      Special JudgeEdward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his frie

2014-10-13 16:31:59 2484

原创 ZOJ3827 ACM-ICPC 2014 亚洲区域赛牡丹江现场赛I题 Information Entropy 水题

Information EntropyTime Limit: 2 Seconds      Memory Limit: 131072 KB      Special JudgeInformation Theory is one of the most popular courses in Marjar University. In this course, there is an

2014-10-13 16:17:08 2156

原创 ZOJ3819 ACM-ICPC 2014 亚洲区域赛牡丹江赛区现场赛A题 Average Score 签到题

Average ScoreTime Limit: 2 Seconds      Memory Limit: 131072 KBBob is a freshman in Marjar University. He is clever and diligent. However, he is not good at math, especially in Mathematical An

2014-10-13 16:06:19 2368

原创 HDU5014 2014ACM-ICPC 亚洲区域赛西安赛区网络赛H题 Number Sequence

#include#include#include#include#include#include#include#include#includeusing namespace std;__int64 a[100005],pa[100005];__int64 cal(__int64 pa){ __int64 ans=0,n=0; while(pa>0)

2014-09-21 10:25:46 1124

原创 HDU5024 2014 ACM-ICPC亚洲区域赛广州赛区网络赛C题 Wang Xifeng's Little Plot

Wang Xifeng's Little PlotTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0    Accepted Submission(s): 0Problem Description 《Dr

2014-09-20 23:27:12 960

原创 Codeforces Round #264 (Div. 2)题解

A. Caisa and Sugartime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCaisa is going to have a party and he needs to buy

2014-08-30 22:43:55 703

原创 2014南邮暑期集训组队赛3 BCD题题解

这次比赛,我主要出的是BCD题,具体B题为2013南京邀请赛题目,具体难度

2014-08-28 16:53:34 513

原创 HDU 4586 Play the Dice 数学期望

C. Pashmak and Busestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Pashmak has been employed in a t

2014-08-28 16:44:30 631

原创 NOJ 2005 BDD和CSS的旅游 状压DP

对于这道题,其实正确思路就是状态压缩DP,对于对于题目中要求的连续m个数中不得选择超过Q个,这其实就是一个状态转移,对于m个数,选取状态为1,不选状态为0,建立状态,然后计算是否含有不超过Q个1,则为可取状态,之后DP【i】【S】则为当选取至第i个数字时第i-m个数到第i-1个数的状态为S时可以选取的最大数,但是很重要一个问题就是状态转移需要仔细考虑,具体方案就是DP【i】【(j>>1)|1>1)

2014-08-28 16:43:55 591

原创 Codeforces Round #261 (Div. 2)题解

这次CF整体不算太难,所有题目YY一下都能够有思路,也没什么好多说的东西。。。

2014-08-19 11:38:14 530

原创 Codeforces 453A Little Pony and Expected Maximum 概率期望

做完这个题才发现自己是个

2014-08-11 15:43:43 556

原创 NOJ 2024 入栈序列和出栈序列 数据结构理解

此题是去年WGZ学长出的暑期题目,我

2014-08-11 15:43:10 931

原创 HDU 4786 Fibonacci Tree 最小生成树 kruskal算法

2013年区域赛成都赛区的签到题

2014-08-11 15:42:24 616

原创 Codeforces 453B Little Pony and Harmony Chest 状压DP

这个题和大威神过去拉的一个

2014-08-11 15:42:09 445

原创 UVALive 6144 Radiation 二分

此题是2012年区域赛泰国一个赛区的题目,可能是东南亚赛区比较水,前面3道

2014-08-11 15:41:57 573

原创 HDU 4472 Count 递推

#include#include#includeusing namespace std;long a[1005];int main(){ int i,j,n; memset(a,0,sizeof(a)); a[1]=1; for(i=1;i<=1000;i++) for(j=1;i*j+1<=1000;j++) a[i*j+1]=(a[i*j+1]+a[i])%10000

2014-08-11 15:41:22 613

原创 南邮暑期集训个人赛6题解

此次题目比较难,但是算法都还是很

2014-08-11 15:39:01 563

原创 HDU 4474 Yet Another Multiple Problem 搜索

这道题具体做法其实很裸,更像是POJ1426上面一道题的变形

2014-08-11 15:38:48 516

原创 POJ 1094 Sorting It All Out 拓扑排序+Floyd算法

Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24697 Accepted: 8557DescriptionAn ascending sorted sequence of distinct values is one in

2013-09-06 23:43:35 716

原创 POJ 3026 Borg Maze 图论 prim算法(最小生成树)+BFS算法(广度优先搜索)

Borg MazeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7151 Accepted: 2405DescriptionThe Borg is an immensely powerful race of enhanced humanoids from t

2013-09-05 23:24:55 997

原创 POJ 1258 Agri-Net 图论 prim算法 最小生成树

Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33892 Accepted: 13621DescriptionFarmer John has been elected mayor of his town! One of his campaig

2013-09-05 15:28:04 581

原创 POJ 2485 Highways 图论 prim算法 最小生成树

HighwaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19136 Accepted: 8871DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Fla

2013-09-05 14:26:01 751

原创 POJ 1789 Truck History 图论 prim算法 最小生成树

Truck HistoryTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15326 Accepted: 5886DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types.

2013-09-05 00:05:11 670

原创 POJ 2240 Arbitrage 图论 Bellman-ford算法

ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13539 Accepted: 5702DescriptionArbitrage is the use of discrepancies in currency exchange rates t

2013-09-04 20:42:21 689

原创 POJ 1125 Stockbroker Grapevine 图论 Floyd-Washall算法

Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23914 Accepted: 13143DescriptionStockbrokers are known to overreact to rumours. You h

2013-09-04 19:44:18 1111

原创 POJ 2253 Frogger 图论 Dijkstra算法

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21864 Accepted: 7122DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly

2013-09-03 23:09:52 724

原创 POJ 1062 昂贵的聘礼 Dijkstra算法

昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32531 Accepted: 9256Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探

2013-09-03 20:47:41 649

原创 POJ 3259 Wormholes 图论 贝尔曼-福特算法(Bellman-Ford)

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

2013-09-03 16:53:48 889

原创 POJ 1860 Currency Exchange 贝尔曼-福特算法(Bellman-Ford)

Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16723 Accepted: 5856DescriptionSeveral currency exchange points are working in our city.

2013-09-02 23:28:26 1119

原创 POJ 2993 Emag eht htiw Em Pleh 大模拟

Emag eht htiw Em PlehTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2391 Accepted: 1612DescriptionThis problem is a reverse case of the problem 2996. Y

2013-09-02 17:48:11 637

原创 POJ 2996 Help Me with the Game 大模拟

Help Me with the GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2927 Accepted: 1900DescriptionYour task is to read a picture of a chessboard position

2013-09-02 17:40:42 809

原创 POJ 1573 Robot Motion 模拟

Robot MotionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9236 Accepted: 4478DescriptionA robot has been programmed to follow the instructions in

2013-09-01 20:05:10 452

原创 POJ 2632 Crashing Robots 模拟

Crashing RobotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6698 Accepted: 2909DescriptionIn a modernized warehouse, robots are used to fetch the goods

2013-09-01 15:52:32 533

原创 POJ 1068 Parencodings 模拟 栈操作

ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17398 Accepted: 10478DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S

2013-09-01 11:35:31 896

原创 POJ 3295 Tautology 构造数列及STL中栈的运用

TautologyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8184 Accepted: 3139DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six f

2013-08-31 22:52:29 698

原创 POJ 2109 Power of Cryptography 语言技巧

Power of CryptographyTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16457 Accepted: 8327DescriptionCurrent work in cryptography involves (among other thi

2013-08-31 17:17:19 807

南京邮电大学第五届程序设计大赛网络赛

2013年南京邮电大学程序设计大赛网络赛题目与题解

2013-06-17

空空如也

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

TA关注的人

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