C语言——coedeforces116A 题解

A. Tram
time limit per test 2 seconds
memory limit per test 256 megabytes
input standard input
output standard output
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.

Input
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.
Output
Print a single integer denoting the minimum possible capacity of the tram (0 is allowed).

Examples
input
4
0 3
2 5
4 2
4 0
output
6
注意事项：

1.sum = sum - a + b；//这句要加上sum

  sum = -a + b；

两者对比：

代码如下：

#include<stdio.h>
int main()
{
int n;
int a,b;
int max = 0,sum = 0;
scanf("%d",&n);
while(n--)
{
scanf("%d%d", &a,&b);
sum = sum -a + b;
if (max < sum)
{
max = sum;
}
}
printf("%d", max);
}

最后

以上就是健康蜻蜓为你收集整理的C语言——coedeforces116A 题解的全部内容，希望文章能够帮你解决C语言——coedeforces116A 题解所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。