fork(1) download
  1. /* package whatever; // don't place package name! */
  2.  
  3. import java.util.*;
  4. import java.lang.*;
  5. import java.io.*;
  6.  
  7. /* Name of the class has to be "Main" only if the class is public. */
  8. class Ideone
  9. {
  10. public static int [] delMax(int [] Arr)
  11. {
  12. int n=Arr.length;
  13. int [] r = new int[n-1];
  14. int i,j,max=Arr[0],imax=0;
  15. for (i=1; i<n; i++)
  16. {
  17. if (Arr[i]>max)
  18. {
  19. imax=i;
  20. max=Arr[i];
  21. }
  22. }
  23. j=0;
  24. for (i=0; i<n; i++)
  25. {
  26. if (i != imax)
  27. {
  28. r[j++]=Arr[i];
  29. }
  30. }
  31. return r;
  32. }
  33.  
  34. public static void printArr(int [] Arr)
  35. {
  36. for (int i=0; i<Arr.length; i++)
  37. {
  38. System.out.print(Arr[i]+" ");
  39. }
  40. System.out.println();
  41. }
  42.  
  43. public static void main (String[] args) throws java.lang.Exception
  44. {
  45. int[] times = {341, 273, 278, 329, 445, 402, 388, 275, 243, 334, 412, 393, 299, 343, 317, 265};
  46. System.out.println("Исходный массив:");
  47. printArr(times);
  48. System.out.println("Максимум удален:");
  49. printArr(delMax(times));
  50. }
  51. }
Success #stdin #stdout 0.05s 2184192KB
stdin
Standard input is empty
stdout
Исходный массив:
341 273 278 329 445 402 388 275 243 334 412 393 299 343 317 265 
Максимум удален:
341 273 278 329 402 388 275 243 334 412 393 299 343 317 265