信息学集训队作业ural竞赛

1、题目来ural1602题目描题目来ural1602题目描算算法证算法实ans 保存最,ans1 保存每个状态的结果,如果优于 ans 则替换 源代var n,k,i,l:long;源代var n,k,i,l:long;fori:=ndownto1do if(n-i)*u(k-1)*v+15thent:=(k-1)*v+15elset:=(n-i)*u; iftansthenbeginans:=t;l:=i;end; if(n-1)*uansthenbeginwri n(1);halt;原题描述1602. TimeLimit:0.5second Memory Limit: 64 MBisatth

2、eupper(nth)floorofar, and hewants to down tofloor.Theindicatoraboveelevator door shows floor and is at the he goes down t theelevatorisnow原题描述1602. TimeLimit:0.5second Memory Limit: 64 MBisattheupper(nth)floorofar, and hewants to down tofloor.Theindicatoraboveelevator door shows floor and is at the

3、he goes down t theelevatorisnowgoingdowntothe level of the kth floor. Petr understandst flights of stairs and calls for the elevator from there he may get Help Petr to determine how many flights floorstairs he should downonefloorinvseconds,useconds.Whentheelevatoroesupor flight of stairs Petrgoesdow

4、n reached the it can go up.floor, s to here for 15 seconds; may tnobodyelsewillcallfortheelevator.Boardingthe seconds. All other delays shouldnt be takenelevatortakes5 u,andv(1knThesingleinput linecontainsthenumbersn,100;0.1v Output the number of the floor which Petr should descend to. If there areseveralequivalentvariants,outputsuchone inwhichPetrwillgo by foot the smaller distance.SAu