Advertisement
Guest User

Untitled

a guest
Dec 12th, 2017
68
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.19 KB | None | 0 0
  1. public static void main(String[] args) {
  2.  
  3. Scanner scanner = new Scanner(System.in);
  4.  
  5. int numberOfTest = scanner.nextInt();
  6.  
  7. for (int test = 0; test < numberOfTest; ++test) {
  8. scanner.next();
  9.  
  10. keysNumber = scanner.nextInt();
  11. int n = keysNumber + 1;
  12. costArray = new int[n][n];
  13. weightsArray = new int[n][n];
  14. nodesArray = new int[n][n];
  15. p = new int[n];
  16. q = new int[n];
  17. keysNames = new String[n];
  18. resultTree = new ArrayList<>();
  19.  
  20. q[0] = scanner.nextInt();
  21. scanner.nextLine();
  22.  
  23. for (int i = 1; i <= keysNumber; i++) {
  24. keysNames[i] = scanner.next();
  25. p[i] = scanner.nextInt();
  26. q[i] = scanner.nextInt();
  27. scanner.nextLine();
  28. }
  29.  
  30. computeAllArrays();
  31. BST();
  32. rootGlobal = ConstructBST(0, keysNumber);
  33. CalculateDisplay(rootGlobal, 0);
  34. Collections.reverse(resultTree);
  35. displayResultTree();
  36. System.out.format(Locale.ENGLISH, "%.4f%n", RESULT);
  37.  
  38. }
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement