1、Ural 1403 對(duì)n個(gè)排序，使得ti為不降列（2D/1D j 天內(nèi)完成，可以獲得的最大收益。轉(zhuǎn)移方程：當(dāng)j 且 ij aj,i=maxaj-1,k|k=1,2i-1+ vi ，否則ai,j=0時(shí)間復(fù)雜度可以簡(jiǎn)單優(yōu)化到O(n2)：i 作外循環(huán)，j 作內(nèi)循環(huán)，動(dòng)態(tài) maxk。其中 maxk表示對(duì)于當(dāng)前的 i，maxak-1,l|l=1,2i-1。這樣 aj,i=maxj-1 + vi 。降低復(fù)雜度，fk=r，使得 maxk=ak-1,r。這樣 mfj,i=fj。const vart,v,max,mf,b:array0.maxnoflongint; a,f:array0.maxn,0.maxno

2、f longint; functionmin(a,b:longint):longint; ifa1thenwrite();write(bi); fori:=1tondoreadln(ti,vi); for i:=1 to n do bi:=i;for i:=1 to n do forj:=i+1tondoiftbitbjthenbegink:=bi;bi:=bj;bj:=k;end; for i:=1 to n do beginforj:=1tomin(i,tbi)dobegin forj:=1toifaj,imaxjthenbeginmaxj:=aj,i;mfj:=i;end; j:=0;f

3、ori:=1tonfmaximaxjthenj:=i; wrin(j);print(j,i); 1403. TimeLimit:1.0second Memory Limit: 16 MBFreddyworksasacourierforVitoMaretti.OnceinthemorningFreddy got an assignmentto deliverN containers of whisky every onetoa differenttownofthestate.Ittakesonedaytodelivereachcontainer from the list.But each of

4、the orders(one order onecontainer)is assigned its particular time of delivery and Freddys reward. If Freddy doesnotdeliveranorderintimehewillgetnorewardandheevencan behauledoverthecoals.Sothereisnosensetodeliversuchorders. HelpFreddytocompileanoperatingschedulethatwouldyieldthe al profit he wont be

5、in a hole.The linecontainsthenumberofordersN(1N1000).Eachof thenextNlinescontainstwointegers:thedeliverytimeandFreddys reward.Thedeliverytimeisnotlessthan1dayandnotmorethan100000 days. The reward is from 1 to 100000 dollars.The lineshouldcontainanumberofordersthatFreddywilldeliver. Thesecondlineshouldcontainalistofcontainersnumbersintheorder oftheirdeliveryseparatedwithspaces.Theout-of-dateordersshould not be delivered. If there are several solutions, output any of them.4312ProblemAuthor: NikitaProblem So