fork download
  1. import java.util.*;
  2.  
  3. public class Main {
  4. public static void main(String[] args) {
  5. Scanner sc = new Scanner(System.in);
  6.  
  7. // Input size
  8. int n = sc.nextInt();
  9. int[] b = new int[n + 1]; // 1-based indexing like in your pseudo
  10.  
  11. for (int i = 1; i <= n; i++) {
  12. b[i] = sc.nextInt();
  13. }
  14.  
  15. int start = 1, end = n;
  16. int turn = 1;
  17. boolean reversed = false;
  18. int p1 = 0, p2 = 0;
  19.  
  20. while (start <= end) {
  21. int selected = 0;
  22.  
  23. if (turn % 2 != 0) { // Player 1's turn
  24. if (!reversed) {
  25. p1 += b[start];
  26. selected = b[start];
  27. start++;
  28. } else {
  29. p1 += b[end];
  30. selected = b[end];
  31. end--;
  32. }
  33. } else { // Player 2's turn
  34. if (!reversed) {
  35. p2 += b[start];
  36. selected = b[start];
  37. start++;
  38. } else {
  39. p2 += b[end];
  40. selected = b[end];
  41. end--;
  42. }
  43. }
  44.  
  45. // If selected number is even → flip reversed
  46. if (selected % 2 == 0) {
  47. reversed = !reversed;
  48. }
  49.  
  50. turn++;
  51. }
  52.  
  53. System.out.println("Player 1 Score: " + p1);
  54. System.out.println("Player 2 Score: " + p2);
  55. }
  56. }
Success #stdin #stdout 0.22s 56944KB
stdin
5
1
2
3
4
5
stdout
Player 1 Score: 9
Player 2 Score: 6