Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
简单Dp,主要是要搞清楚时间的转换Time[i],表示第i辆车过河 并且船回来(注意)的时间; Trip[i],表示第i辆车过完河 ,船的来回次数; temp = max(Time[j],T[i]) + 2*t;/*why??*/ if (temp >= Time[i]) { if(temp == Time[i]) Trip[i]... else Trip[i]... Time[i] = temp; } Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator