XYBDX的博客

题目链接：CodeForces - 1249E题目大意：你现在所处位置在1楼，给出你两组数据，第一组为从i到i+1走楼梯所需要的时间，第二组为从i到i+1坐电梯所需要的时间，从走楼梯转向电梯需要等c时间。从1楼向二楼走也需要等c时间。思路：动态规划。状态转移方程：dp[i][0]=min(dp[i-1][0]+b[i-1],dp[i-1][1]+b[i-1]+c);dp...

题目链接：CodeForces - 1249D2 The only difference between easy and hard versions is constraints.You are givennnsegments on the coordinate axisOXOX. Segments can intersect, lie inside each other and ...

题目链接：CodeForces - 1249D1The only difference between easy and hard versions is constraints.You are givennnsegments on the coordinate axisOXOX. Segments can intersect, lie inside each other and e...

Good NumbersThe only difference between easy and hard versions is the maximum value of n.You are given a positive integer number n. You really love good numbers so you want to find the smallest goo...

题目链接：CodeForces - 1249C1Good NumbersThe only difference between easy and hard versions is the maximum value of n.You are given a positive integer number n. You really love good numbers so you wa...

题目链接：CodeForces - 1249B2 The only difference between easy and hard versions is constraints.There arennkids, each of them is reading a unique book. At the end of any day, theii-th kid will give ...