116A - Tram
来源:互联网 发布:删除数据库冗余信息 编辑:程序博客网 时间:2024/06/05 01:40
Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop aipassengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop. Also, when the tram arrives at the last stop, all passengers exit so that it becomes empty.
Your task is to calculate the tram's minimum capacity such that the number of people inside the tram at any time never exceeds this capacity. Note that at each stop all exiting passengers exit before any entering passenger enters the tram.
The first line contains a single number n (2 ≤ n ≤ 1000) — the number of the tram's stops.
Then n lines follow, each contains two integers ai and bi (0 ≤ ai, bi ≤ 1000) — the number of passengers that exits the tram at the i-th stop, and the number of passengers that enter the tram at the i-th stop. The stops are given from the first to the last stop in the order of tram's movement.
- The number of people who exit at a given stop does not exceed the total number of people in the tram immediately before it arrives at the stop. More formally, . This particularly means that a1 = 0.
- At the last stop, all the passengers exit the tram and it becomes empty. More formally, .
- No passenger will enter the train at the last stop. That is, bn = 0.
Print a single integer denoting the minimum possible capacity of the tram (0 is allowed).
40 32 54 24 0
6
For the first example, a capacity of 6 is sufficient:
- At the first stop, the number of passengers inside the tram before arriving is 0. Then, 3 passengers enter the tram, and the number of passengers inside the tram becomes 3.
- At the second stop, 2 passengers exit the tram (1 passenger remains inside). Then, 5 passengers enter the tram. There are 6 passengers inside the tram now.
- At the third stop, 4 passengers exit the tram (2 passengers remain inside). Then, 2 passengers enter the tram. There are 4 passengers inside the tram now.
- Finally, all the remaining passengers inside the tram exit the tram at the last stop. There are no passenger inside the tram now, which is in line with the constraints.
Since the number of passengers inside the tram never exceeds 6, a capacity of 6 is sufficient. Furthermore it is not possible for the tram to have a capacity less than 6. Hence, 6 is the correct answer.
import java.util.*;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int max=0; int c=0; for(int i=0;i<n;i++) { int out=sc.nextInt(); int in=sc.nextInt(); c-=out; c+=in; max=c>max?c:max; } System.out.println(max); }}
- CodeForces-116A-Tram
- 116A - Tram
- 116A - Tram
- CodeForces 116A Tram
- CF 116A Tram
- Codeforces 116A Tram
- CodeForces 116A Tram
- codeforces 116A Tram
- Problem--116A--Codeforces--Tram
- A. Tram
- codeforces 116A Tram(模拟水题)
- codeforces 116A(Tram) Java
- CodeForces 116 A.Tram(水~)
- 【找最值】#87 A. Tram
- Codeforces刷题之路——116A Tram
- Tram
- Tram
- PKU1847 tram
- css 属性总结(三):positioning, dimension, list, table
- 大根堆升序排序
- 基于Zynq平台的设备树指南 --第三部分
- 158B - Taxi
- 231A - Team
- 116A - Tram
- 多任务临界段(原语操作)讨论
- 人品计算机2.0
- 通俗易懂:编译器的工作过程
- 第一章 对象导论
- 开源CEGUI编辑器之二(MFC重写的ImagesetEditor)
- 基于Zynq平台的设备树指南 --第四部分
- 实时操作系统的优秀文章
- Apache与Nginx的优缺点比较