1317 - Concert Hall Scheduling

All about problems in Volume 13. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

Post Reply
Repon kumar Roy
Learning poster
Posts: 96
Joined: Tue Apr 23, 2013 12:54 pm

Re: 1317 - Concert Hall Scheduling

Post by Repon kumar Roy » Wed Nov 11, 2015 7:40 am

Algorithm to solve:
Mincost Maxflow
Graph Construct:
1. for i,j,w , give i -> j+1, with capacity 1, cost -w
2. for i=0 to 355, give i->i+1, with capacity 2, cost 0
3. Calculate mincost Max flow, ans = - MincostMaxflow

Post Reply

Return to “Volume 13 (1300-1399)”