题目来源:赛码网
网址:http://exercise.acmcoder.com/online/online_judge_ques?ques_id=1659&konwledgeId=134
代码:
package exam;
import java.util.Scanner;
public class parctise {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int n;
n=in.nextInt();
int [] arr = new int[n+1];
int [] k=new int[n];
int [] l=new int[n];
int max=0;
for (int i = 0; i < n; i++) {
k[i]=in.nextInt();
l[i]=in.nextInt();
}
for (int i = 0; i < n; i++) {
//System.out.println(max+" "+l[i]+" "+k[i]);
arr[i+1]=arr[i]+l[i]-k[i];
if(arr[i+1]>max) {
max=arr[i+1];
}
}
System.out.println(max);
}
}