| ||||||||||
| 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 | |||||||||
这题精度会让人迷茫的啊。。。。 double last_t = time;
time += min;
for (i=0; i<sp; i++)
{
arr[stack[i]].finish = time;
Free += arr[stack[i]].now;
arr[stack[i]].del = true;
nLeft--;
}
for (i=0; i<nTasks; i++)
{
if (!arr[i].del)
arr[i].left -= arr[i].now*min;
min改成(time-last_t) 就不行。。。
}
做的我也迷茫了。。。难道加减法也有误差??
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator