2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 B. Train Seats Reservation

最新推荐文章于 2017-11-27 13:05:00 发布

LP_Cong

最新推荐文章于 2017-11-27 13:05:00 发布

阅读量417

点赞数

CC 4.0 BY-SA版权

分类专栏： ————ACM相关———— ——算法技巧—— ACM - 简单题

Why is everything so heavy?

本文链接：https://blog.csdn.net/lzc504603913/article/details/78078119

————ACM相关———— 同时被 3 个专栏收录

362 篇文章

订阅专栏

——算法技巧——

73 篇文章

订阅专栏

ACM - 简单题

36 篇文章

订阅专栏

本文介绍了一个算法问题，即如何计算一列火车从起点到终点所需的最少座位数量，以满足所有乘客的需求而没有冲突。该算法考虑了乘客在不同站点上下车的情况，并通过模拟过程解决了问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given a list of train stations, say from the station $1$ to the station $100$ .

The passengers can order several tickets from one station to another before the train leaves the station one. We will issue one train from the station $1$ to the station $100$ after all reservations have been made. Write a program to determine the minimum number of seats required for all passengers so that all reservations are satisfied without any conflict.

Note that one single seat can be used by several passengers as long as there are no conflicts between them. For example, a passenger from station $1$ to station $10$ can share a seat with another passenger from station $30$ to $60$ .

Input Format

Several sets of ticket reservations. The inputs are a list of integers. Within each set, the first integer (in a single line) represents the number of orders, $n$ , which can be as large as $1000$ . After $n$ , there will be $n$ lines representing the $n$ reservations; each line contains three integers $s, t, k$ , which means that the reservation needs $k$ seats from the station $s$ to the station $t$ .These ticket reservations occur repetitively in the input as the pattern described above. An integer $n = 0$ (zero) signifies the end of input.

Output Format

For each set of ticket reservations appeared in the input, calculate the minimum number of seats required so that all reservations are satisfied without conflicts. Output a single star '*' to signify the end of outputs.

样例输入

样例输出

20
60
*

题目来源

2017 ACM-ICPC 亚洲区（南宁赛区）网络赛

题意：每到一个车站有人下车和上车……求需要的最少座位数

解题思路：由于车站很少……直接模拟上下车的过程即可……

#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long int ll;


struct point{
	int shang;
	int xia;
	ll k;
}list[1005];

bool cmp(point a,point b){
	if(a.shang==b.shang)
	return a.xia<b.xia;
	else
	return a.shang<b.shang;
}

int main(){
	
	int n;
	
	while(~scanf("%d",&n)){
		if(n==0){
			printf("*\n");
			break;
		}
		
		ll ans=0;
		ll mmm=0;

		for(int i=0;i<n;i++){
		scanf("%d%d%lld",&list[i].shang,&list[i].xia,&list[i].k);
		}
		
		sort(list,list+n,cmp);
		
		for(int i=0;i<100;i++){
			
			
			for(int j=0;j<n;j++){
				
				if(list[j].xia==i){
					ans-=list[j].k;
				}
				
				if(list[j].shang==i){
					ans+=list[j].k;
					mmm=max(mmm,ans);
				}
				
			}
			
		}
		
		printf("%lld\n",mmm);
		
	}
	
	return 0;
}