自定义博客皮肤VIP专享

*博客头图:

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

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

博客底图:

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

栏目图:

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

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

猿的进化

ACM~java~web~密码学

  • 博客(303)
  • 收藏
  • 关注

原创 poj2251 搜索

B - Dungeon MasterTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2251DescriptionYou are trapped in a 3D dungeon and need t

2016-03-10 21:31:40 261

原创 hdu2616搜索

N - Find a wayTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2612DescriptionPass a year learning in Hangzhou, yifenfei arr

2016-03-10 21:29:54 261

原创 poj3469最大流(最大割)

Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 22059 Accepted: 9587Case Time Limit: 5000MSDescriptionAs more and more computers ar

2016-03-10 09:41:02 404

原创 hdu4292 网络流 —最大流

FoodTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4364    Accepted Submission(s): 1475Problem Description  You, a part-time di

2016-03-09 18:34:13 326

原创 hdu1087最大流

A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15409 Accepted: 5224DescriptionYou are in charge of setting up the press room for the ina

2016-03-09 17:55:08 265

原创 hdu2255二分图最大权匹配

一体”全攻略! 招聘——巴卡斯科技(杭州)、英雄互娱(杭州)奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6340    Accepted Submission(s): 2789

2016-03-08 21:11:14 444

原创 最小树形图uva11183

Problem ITeen Girl Squad Input: Standard Input Output: Standard Output You are part of a group of n teenage girls armed with cellphones. You have some news you want to tell everyone in the gro

2016-03-08 15:58:23 266

原创 hdu2819二分图匹配

E - SwapTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2819DescriptionGiven an N*N matrix with each entry equal to 0 or 1.

2016-02-29 21:31:16 509

原创 hdu2444二分匹配

B - The Accomodation of StudentsTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2444DescriptionThere are a group of student

2016-02-29 21:29:24 295

原创 hdu1083二分图匹配

C - CoursesTime Limit:10000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1083DescriptionConsider a group of N students and P courses. Ea

2016-02-29 21:24:14 316

原创 hdu1281二分图匹配

D - 棋盘游戏Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1281Description小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们

2016-02-29 21:21:42 333

原创 图论训练2A--hdu4081

Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5986    Accepted Submission(s): 2085Problem Desc

2016-02-29 18:05:31 365

原创 poj1679次小生成树

A - The Unique MSTTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1679DescriptionGiven a connected undirected graph, tell

2016-02-28 12:46:27 314

转载 连通图hdu1045

A - Fire NetTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1045DescriptionSuppose that we have a square city with straight

2016-02-24 09:57:14 320

原创 hdu3416

http://acm.hdu.edu.cn/showproblem.php?pid=3416Marriage Match IVTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2948    Accepte

2016-01-30 10:58:44 511

原创 poj2135

Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13920 Accepted: 5292DescriptionWhen FJ's friends visit him on the farm, he likes to show them a

2016-01-23 17:05:56 331

原创 poj2195 spfa 最小费用最大流

Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20302 Accepted: 10296DescriptionOn a grid map there are n little men and n houses. In each uni

2016-01-23 16:37:02 290

原创 poj3281 最大流

DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12634 Accepted: 5801DescriptionCows are such finicky eaters. Each cow has a preference for certain

2016-01-23 16:32:01 236

原创 poj1511最短路 spfa

Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 23260 Accepted: 7657DescriptionIn the age of television, not many people attend theater

2016-01-13 14:46:57 362

原创 poj2240

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

2016-01-08 21:10:41 317

原创 poj1502

MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7445 Accepted: 4533DescriptionBIT has recently taken delivery of their new supercomputer, a

2016-01-08 21:04:22 308

原创 poj3660

Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8765 Accepted: 4931DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participa

2016-01-06 21:46:33 758

原创 3268最短路问题

Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16272 Accepted: 7448DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently

2016-01-05 21:06:05 368

原创 poj1797

Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 26357 Accepted: 7011DescriptionBackground Hugo Heavy is happy. After the breakdown of the Cargolifter project he

2016-01-04 19:07:35 475

原创 poj2253 最小生成树最大权

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32122 Accepted: 10351DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Sudden

2016-01-04 17:04:54 462

原创 二叉索引树,求前缀数组和,区间和

#include using namespace std;const int maxn=1e5+5;int c[maxn],a[maxn];int n;int lowbit(int x){ return x&(-x);}int sum(int x){ int ans=0; while(x>0) { ans+=c[x];

2016-01-02 15:13:34 451

原创 hud1114 完全背包

http://acm.hdu.edu.cn/showproblem.php?pid=1114加礼#——买六个月送域名代金券!Piggy-BankTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submi

2015-12-30 16:39:25 289

原创 hdu1087

http://acm.hdu.edu.cn/showproblem.php?pid=1087#include #include #include #include #include using namespace std;const int MAXN=1005;const int INF=1e8;int dp[MAXN],d[MAXN];int main(){

2015-12-30 16:34:05 310

原创 hdu1069 Monkey and Banana

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=68966#problem/C、#include #include #include #include #include using namespace std;struct ac{ int x,y,z,high,dp;} d[205];bool cmp(ac

2015-12-30 16:23:42 339

原创 poj3280

Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7352 Accepted: 3551DescriptionKeeping track of all the cows can be a tricky task so F

2015-12-26 16:36:48 72

原创 素因子分解超快的Pollard_rho算法

C - Aladdin and the Flying CarpetTime Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1341DescriptionIt's said that Aladdin had to

2015-12-21 20:17:16 1018

原创 数论欧拉函数

A - Bi-shoe and Phi-shoeTime Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1370DescriptionBamboo Pole-vault is a massively popul

2015-12-21 15:24:01 518

原创 欧拉函数

两种晒发+1中单个查询const int maxn=1500000;int a[maxn];void Init_oula()///预处理求出1到N的欧拉函数的值 { int i,j; memset ( a, 0 ,sizeof (a)) ; for ( i = 2 ; i <= N ; i ++ ) {//筛选求a if

2015-12-21 14:30:55 323

原创 poj3723最小生成树

ConscriptionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9705 Accepted: 3451DescriptionWindy has a country, and he wants to build an army to protect

2015-12-18 16:11:32 395

原创 最小生成树

#include #include using namespace std;const int maxn=10000;struct edge{ int u,v,cost;}es[maxn];bool cmp(edge e1,edge e2){ return e1.cost<e2.cost;}int par[maxn],rank[maxn];void init(

2015-12-18 16:00:14 278

原创 poj1703

Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 38075 Accepted: 11714DescriptionThe police office in Tadu City decides to say ends

2015-12-17 21:23:53 255

原创 poj3255次短路算法

RoadblocksTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10539 Accepted: 3756DescriptionBessie has moved to a small farm and sometimes enjoys returning

2015-12-17 21:11:34 3312 1

原创 codeforce 241div2 D

D. Population Sizetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus develops an interesting theory

2015-12-07 20:50:39 518

原创 hdu1029 B - Ignatius and the Princess IV

B - Ignatius and the Princess IVTime Limit:1000MS     Memory Limit:32767KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1029Description"OK, you are not too bad, em

2015-12-04 21:24:51 304

原创 cf C - Booking System

C - Booking SystemTime Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 416CDescriptionInnovation technologies are on a v

2015-12-04 21:22:44 443

空空如也

空空如也

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

TA关注的人

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