[TOJ 2663] Concert Hall Scheduling
来源:互联网 发布:房屋三维设计效果软件 编辑:程序博客网 时间:2024/06/05 01:03
In order to make more money, you have decided to abandon the previous fixed price policy, and rather let applicants specify the price they are ready to pay. Each application shall specify a period [i,j] and an asking price w, where i and j are respectively the first and last days of the period (1 ≤i ≤ j ≤ 365), and w is a positive integer in yen, indicating the amount the applicant is willing to pay to use a room for the whole period.
You have received applications for the next year, and you should now choose the applications you will accept. Each application should be either accepted for its whole period or completely rejected. Each concert should use the same room during the whole applied period.
Considering the dire economic situation of the concert hall, artistic quality is to be ignored, and you should just try to maximize the total income for the whole year by accepting the most profitable applications.
Input
The input has multiple data sets, each starting with a line consisting of a single integern, the number of applications in the data set. Then, it is followed by n lines, each of which represents one application with a period [i,j] and an asking price w yen in the following format.
i j w
A line containing a single zero indicates the end of the input.
The maximum number of applications in a data set is one thousand, and the maximum asking price is one million yen.
Output
For each data set, print a single line containing an integer, the maximum total income in yen for the data set.
Sample Input
41 2 102 3 103 3 101 3 1061 20 10003 25 100005 15 500022 300 550010 295 90007 7 6000832 251 2261123 281 1339211 235 5641162 217 727322 139 7851194 198 9190119 274 878122 173 86400
Output for the Sample Input
302550038595
将每天拆点成开始和结束,使用房间的情况当作流量,正常情况什么也不做直接向下一天连边,无费用,或者是从某一天的开始到另一天的结尾表示占用此房间,费用为收益,做最大费用最大流即可。
#include<iostream>#include<cstring>#include<algorithm>#include<queue>using namespace std;const int inf=1010101010;int n,m;struct edge{ int v,c,w,next;}e[150000];int head[40000],cnt;void addedge(int u,int v,int c,int w){ e[cnt].v=v; e[cnt].c=c; e[cnt].w=w; e[cnt].next=head[u]; head[u]=cnt++; e[cnt].v=u; e[cnt].c=0; e[cnt].w=-w; e[cnt].next=head[v]; head[v]=cnt++;}int a[40000],b[40000];int S,T;int dis[100010];bool vis[100010];int pre[100010];int pos[100010];int gao(){ int ans=0; while(1){ for(int i=0;i<=T;i++) dis[i]=-1,vis[i]=0,pre[i]=i,pos[i]=0; queue<int> q; dis[S]=0; q.push(S); vis[S]=1; int u,v,w,c; while(!q.empty()) { u=q.front(); q.pop(); vis[u]=0; for(int i=head[u];i!=-1;i=e[i].next) { v=e[i].v; if(e[i].c>0&&dis[v]<dis[u]+e[i].w) { pre[v]=u; pos[v]=i; dis[v]=dis[u]+e[i].w; //cout<<u<<" "<<v<<dis[v]<<endl; if(!vis[v]) { vis[v]=1; q.push(v); } } } } //cout<<"kk"<<endl; if(dis[T]==-1) break; //cout<<dis[T]<<"jj"<<endl; int sum=inf; for(u=T;u!=S;u=pre[u]) { c=e[pos[u]].c; sum=min(sum,c); } for(u=T;u!=S;u=pre[u]) { e[pos[u]].c-=sum; e[pos[u]^1].c+=sum; ans+=sum*e[pos[u]].w; } } return ans;}int main(){ int t; //cin>>t; while(cin>>n,n) { memset(head,-1,sizeof(head)); cnt=0; S=0;T=366; for(int i=0;i<366;i++) addedge(i,i+1,2,0); int x,y,w; while(n--) { cin>>x>>y>>w; addedge(x,y+1,1,w); } cout<<gao()<<endl; }}
- [TOJ 2663] Concert Hall Scheduling
- POJ2047-Concert Hall Scheduling
- Concert Hall Scheduling UVALive
- poj 2047 Concert Hall Scheduling
- POJ-2047-Concert Hall Scheduling
- LA 2796 Concert Hall Scheduling 费用流
- [POJ2047] Concert Hall Scheduling && 费用流
- uva 1317 - Concert Hall Scheduling(最小费用最大流)
- UVA 1317 - Concert Hall Scheduling(网络流)
- uva 1317 poj 2047 Concert Hall Scheduling(费用流)
- (beginer) 网络流(区间模型+最大费用流) UVA 1317 Concert Hall Scheduling
- toj. Job Scheduling
- 优先队列运用 TOJ 4123 Job Scheduling
- City hall
- City hall
- Dinner Hall
- HALL定理
- HALL介绍
- hdu 5402 ,Travelling Salesman Problem,2015多校联合训练赛#9
- 黑马程序员——视频学习过程3
- Android插件技术——(三)加载未安装apk
- poj - 1426-Find The Multiple-BFS
- 通过网络获取图片并缓存
- [TOJ 2663] Concert Hall Scheduling
- 最大子数组和(最大子段和)
- 1081. Rational Sum
- SS2H项目开发历程
- NOIP2012 借教室
- 欢迎使用CSDN-markdown编辑器
- poj-1426 Find The Multiple
- poj 2187 Beauty Contest(凸包)
- 给中国学生的第四封信:大学四年应是这样度过(下)