ACM_POJ

487-3279----模拟

487-3279TimeLimit:2000msMemoryLimit:65536KiBSubmitStatisticDiscussProblemDescriptionBusinessesliketohavememorabletelephonenumbers.Onewaytomakeatelephonenumbermemorableistohaveitspellamemorablewordorph
bless295·2020-09-12 04:17

Finding Nemo--BFS

FindingNemoTimeLimit:2000MSMemoryLimit:30000KTotalSubmissions:9060Accepted:2122DescriptionNemoisanaughtyboy.Onedayhewentintothedeepseaallbyhimself.Unfortunately,hebecamelostandcouldn'tfindhiswayhome.T
bless295·2020-08-02 23:40

Flip Game----状压（枚举）

FlipGameTimeLimit:1000MSMemoryLimit:65536KTotalSubmissions:38784Accepted:16851DescriptionFlipgameisplayedonarectangular4x4fieldwithtwo-sidedpiecesplacedoneachofits16squares.Onesideofeachpieceiswhitean
bless295·2016-05-16 18:13

Dropping tests--计算方法，01分数规划

DroppingtestsTimeLimit:1000MSMemoryLimit:65536KTotalSubmissions:10257Accepted:3578DescriptionInacertaincourse,youtakentests.Ifyougetaioutofbiquestionscorrectontesti,yourcumulativeaverageisdefinedtobe.
bless295·2020-08-25 02:30

POJ 2955——Brackets【区间DP】

题目传送门DescriptionWegivethefollowinginductivedefinitionofa“regularbrackets”sequence:theemptysequenceisaregularbracketssequence,ifsisaregularbracketssequence,then(s)and[s]areregularbracketssequences,andi
nirvana · rebirth·2020-07-06 23:59

POJ（2503）（两种方法，二分，Map）

#pragmawarning(disable:4996)#include#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;structnode{charstr1[15];charstr2[15];}letter[100005];boolcmp(nodea,
zytjyh·2016-09-07 21:30

POJ 2392——Space Elevator【多重背包 & 二进制优化 & 贪心】

题目传送门DescriptionThecowsaregoingtospace!Theyplantoachieveorbitbybuildingasortofspaceelevator:agianttowerofblocks.TheyhaveK(1#include#include#include#include#include#include#include#include#include#incl
nirvana · rebirth·2020-08-15 10:53

POJ 3744（矩阵概率dp）

#pragmawarning(disable:4996)#include#include#include#include#include#include#include#includeusingnamespacestd;structMatrix{doublemat[2][2];};Matrixmul(Matrixa,Matrixb){Matrixret;for(inti=0;i>=1;}retur
zytjyh·2016-08-17 15:44

POJ 2437（贪心）

#include#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;structnode{intstart;intend;}mud[10005];boolcmp(nodea,nodeb){returna.start>N>>L){for(inti=1;i>mu
zytjyh·2016-08-21 19:18

POJ 1328(贪心）

#include#include#include#include#include#include#include#includeusingnamespacestd;structpoint{doubleleft,right;}p[2010],temp;boolcmp(pointa,pointb){returna.left>n>>r&&(n||r)){boolflag=false;for(inti=1
zytjyh·2016-08-21 11:11
上一页 1 2 3 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他