Codeforces 116A Solution - Tram Solution In Java

Program

import java.util.*; public class x { public static void main(String args[]) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int i=0; int a[] = new int[1000]; int b[] = new int[1000]; int max = 0; for(i=0;i<n;i++) { if(i==0) { a[i] = sc.nextInt(); b[i] = sc.nextInt(); } else { a[i] = sc.nextInt(); b[i] = sc.nextInt(); b[i] = b[i]+b[i-1]-a[i]; } } for(i=0;i<n-1;i++) { if(b[i]>max) { max = b[i]; } } System.out.println(max); } }

Output

I/P : ----- 4 0 3 2 5 4 2 4 0 ----- O/P : 6 -----

Codeforces 58A Solution - Chat room Solution In Java