Description: Greedy algorithm for solving the report and source code. Problem Description: In the night, n individuals want as quickly as possible through a river. There is a small river on the bridge, each with a maximum of only two people crossing a river. As a result of the bridge the road was dark, they must use only a flashlight to illuminate the road. N individuals were known to cross the river need to t1, t2, ..., tn time, two people with the time required to cross the river is slow depending on the person required. Please individuals across the river n to calculate the minimum time required.
File list (Check if you may need any files):
river
.....\Debug
.....\.....\river.obj
.....\.....\river.pch
.....\.....\vc60.idb
.....\.....\vc60.pdb
.....\input.txt
.....\output.txt
.....\river
.....\.....\river0.in
.....\.....\river0.out
.....\.....\river1.in
.....\.....\river1.out
.....\river.cpp
.....\river.dsp
.....\river.dsw
.....\river.ncb
.....\river.opt
.....\river.pdf
.....\river.plg
.....\river.ppt
Download