精品偷拍一区二区三区,亚洲精品永久 码,亚洲综合日韩精品欧美国产,亚洲国产日韩a在线亚洲

  • <center id="usuqs"></center>
  • 
    
  • 英語翻譯

    英語翻譯
    David hates to wait at stop signs,yield signs and traffic signals while driving.To minimize this aggravation,he has prepared maps of the various regions in which he frequently drives,and measured the average delay (in seconds) at each of the various intersections in these regions.He wants to find the routes between specified points in these regions which minimize his delay at intersections (regardless of the total distance he has to drive to avoid delays),and has enlisted your assistance in this effort.
    Input
    For each region,David provides you with a map.The map data first identifies some number of intersections,NI.The regions never include more than 10 intersections.The intersections in each region are numbered sequentially,starting with the number one (1).For each intersection,in turn,the input then specifies the number of streets leading away from the intersection,and for each such street,the number of the intersection to which the street leads,and the average delay,in seconds,that David encounters at that intersection.Following the data for the last intersection in a region there appear the numbers associated with the intersections where David wants to start and end his drive.The entire input consists of a sequence of maps,followed by the single integer zero (0).
    Output
    For each region,in order,print a single line of output which contains the region number (they,too,are sequentially numbered,starting with 1),a list of the intersection numbers David will encounter in the route with minimum average delay,and the average number of seconds he will be delayed while travelling this route.A suitable format is shown in the example below.
    Notes
    There will always be a unique route with the minimum average delay in each region.
    A street from intersection I to intersection J is one-way.To represent a two-way street from I to J,the map must also include a route from intersection J to intersection I.
    There will never be more than one route directly from intersection I to intersection J.
    Example
    Suppose David wants to travel from intersection 2 to intersection 4 in the region shown in the following map:
    英語人氣:176 ℃時間:2020-06-20 15:04:21
    優(yōu)質(zhì)解答
    大衛(wèi)討厭等待停止的跡象,產(chǎn)量標(biāo)志和交通信號,而駕駛.為了盡量減少這種惡化,他已經(jīng)準(zhǔn)備地圖,各地區(qū),他經(jīng)常驅(qū)動器和測量的平均延遲時間(以秒為單位)在各個不同的十字路口在這些地區(qū).他希望找到指定的路線點之間在這...
    我來回答
    類似推薦
    請使用1024x768 IE6.0或更高版本瀏覽器瀏覽本站點,以保證最佳閱讀效果。本頁提供作業(yè)小助手,一起搜作業(yè)以及作業(yè)好幫手最新版!
    版權(quán)所有 CopyRight © 2012-2024 作業(yè)小助手 All Rights Reserved. 手機(jī)版