For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled.
1 2 3 2 3 1 0
17 41
---------------------------------------------
Code:
#include "stdio.h"
int main(int argc, char* argv[])
{
int n,j,from,to,time;
while((scanf("%d",&n)==1)&&(n!=0))
{
from = 0;
time = 0;
for(j=1;j<=n;j++)
{
scanf("%d",&to);
if(from<to)
{
time+=(to-from)*6+5;
}
else
{
time+=(from-to)*4+5;
}
from = to;
}
printf("%d\n",time);
}
return 0;
}