Advertisement
lameski

Untitled

Mar 21st, 2017
95
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.22 KB | None | 0 0
  1. import java.util.Scanner;
  2.  
  3. public class Nikola4 {
  4. public static void main(String[] args) {
  5. Scanner in = new Scanner(System.in);
  6. String s = in.nextLine();
  7. String split[] = s.split(" ");
  8. int [] niza = new int[split.length];
  9.  
  10. for(int i = 0; i < split.length; i++)
  11. {
  12. niza[i] = Integer.parseInt(split[i]);
  13. }
  14. System.out.println(reverse(niza));
  15.  
  16. }
  17. /*public static int reverse(int [] niza)
  18. {
  19. int diff = dif(niza);
  20. for(int i=0; i<niza.length; i++)
  21. {
  22. if(Math.abs(niza[i]-niza[i+1])!=diff)
  23. {
  24.  
  25. }
  26. }
  27. }*/
  28. public static int reverse(int[] split)
  29. {
  30. int lower = 0;
  31. int upper = 0;
  32. int sum = 0;
  33. int diff;
  34. boolean temp = false;
  35. boolean temp2 = false;
  36. for(int i = 0; i < split.length; i++)
  37. {
  38. sum+=split[i];
  39. if(i<=split.length/2)
  40. lower+=split[i];
  41. else
  42. upper+=split[i];
  43. }
  44. /*for(int i=0; i<split.length-1; i++)
  45. {
  46. if(split[i] != split[i+1])
  47. {
  48. temp = true;
  49. break;
  50. }
  51. }*/
  52. diff = Math.abs(split[1]-split[2]);
  53. for(int i=0; i<split.length-1; i++)
  54. {
  55. if(split[i]+diff!=split[i+1])
  56. {
  57. temp2 = true;
  58. break;
  59. }
  60. }
  61. if(!temp2)
  62. {
  63. return sum;
  64. }
  65. else if(lower < upper)
  66. {
  67. sum = 0;
  68. int dif = 0;
  69. for(int i=0; i<split.length-1; i++)
  70. {
  71. //int diff=0;
  72. while(split[i]>=split[i+1])
  73. {
  74. split[i+1]*=2;
  75. }
  76. //sum+=split[i];
  77. //break;
  78. }
  79. dif = Math.abs(split[1]-split[2]);
  80. for(int i=0; i<split.length-1; i++)
  81. {
  82. if(split[i]+dif==split[i+1])
  83. {
  84. sum+=split[i];
  85.  
  86. }
  87. else
  88. {
  89. //sum+=split[i];
  90. sum+=split[i]*2;
  91. //System.out.println(i);
  92. }
  93. }
  94. sum+=split[split.length-1];
  95. return sum;
  96. }
  97. else
  98. {
  99. sum = 0;
  100. int dif = 0;
  101. for(int i=0; i<split.length-1; i++)
  102. {
  103. while(split[i]<=split[i+1])
  104. {
  105. split[i]*=2;
  106. }
  107.  
  108. }
  109. dif = Math.abs(split[1]-split[2]);
  110. //System.out.println(dif);
  111. for(int i=0; i<split.length-1; i++)
  112. {
  113. if(split[i]-dif==split[i+1])
  114. {
  115. sum+=split[i];
  116.  
  117. }
  118. else
  119. {
  120. sum+=split[i];
  121. sum+=split[i+1]*2;
  122. System.out.println(i);
  123. }
  124. }
  125. return sum;
  126. }
  127. }
  128. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement