Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package com.company;
- import java.util.Scanner;
- public class Problem {
- public static void main(String[] args){
- Scanner sc = new Scanner(System.in);
- int n = sc.nextInt();
- int[][] coins = new int[2][n];
- for(int i=0; i<2; i++){
- for(int j=0; j < n; j++)
- coins[i][j] = sc.nextInt();
- }
- System.out.println(helpMeera(coins, n));
- }
- public static int helpMeera(int[][] coins, int n){
- int[] top = new int[n];
- int[] bottom = new int[n];
- top[0] = coins[0][0];
- bottom[n-1] = coins[1][n-1];
- for(int i=1; i < n ; i++)
- top[i] = top[i-1] + coins[0][i];
- for(int i=n-2; i >= 0; i--)
- bottom[i] = bottom[i+1] + coins[1][i];
- int result = 0;
- for(int i=0; i < n; i++){
- result = Math.max(result, top[i] + bottom[i]);
- }
- return result;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement