fork download
copy 
  1. import java.util.Scanner;
  2.  
  3. class PlayerTurns {
  4.     public static void main(String[] args) {
  5.  
  6.         Scanner sc = new Scanner(System.in);
  7.  
  8.         int n = sc.nextInt();
  9.  
  10.         int[] arr = new int[n];
  11.  
  12.         for (int i = 0; i < n; i++) {
  13.             arr[i] = sc.nextInt();
  14.         }
  15.  
  16.         int left = 0;
  17.         int right = n - 1;
  18.  
  19.         int p1sum = 0;
  20.         int p2sum = 0;
  21.  
  22.         boolean p1Turn = true;
  23.         boolean reversed = false;
  24.  
  25.         // if we have odd num elem then we need left==right for the mid elem
  26.         while (left <= right) {
  27.  
  28.             int curr;
  29.  
  30.             if (!reversed) {
  31.                 curr = arr[left++];
  32.             } else {
  33.                 curr = arr[right--];
  34.             }
  35.  
  36.             if (p1Turn) {
  37.                 p1sum += curr;
  38.             } else {
  39.                 p2sum += curr;
  40.             }
  41.  
  42.             p1Turn = !p1Turn;
  43.  
  44.             if (curr % 2 == 0) {
  45.                 reversed = !reversed;
  46.             }
  47.         }
  48.  
  49.         System.out.println(p1sum - p2sum);
  50.     }
  51. }
Success #stdin #stdout 0.11s 56492KB
comments (?)
stdin
copy 
5
1 2 3 4 5
stdout
copy 
3
https://ideone.com/l1yXII
language:
Java (HotSpot 12)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!