Guest User

Untitled

a guest
May 26th, 2018
116
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.70 KB | None | 0 0
  1. #include <fstream>
  2.  
  3. using namespace std;
  4.  
  5. int main() {
  6. ifstream fin("height.in");
  7. ofstream fout("height.out");
  8. int N;
  9. int Left_element;
  10. int Right_element;
  11. int key;
  12. int max;
  13. int i;
  14. fin >> N;
  15. if (N < 1) {fout << N;} else {
  16. int *array = new int[N+1];
  17. array[1] = 1;
  18. for (i = 1; i <= N; i++) {
  19. fin >> key >> Left_element >> R;
  20. if (Left_element > 0) {array[Left_element] = array[i]+1;};
  21. if (Right_element > 0) {array[Right_element] = array[i]+1;};
  22. };
  23. max = array[N];
  24. for (int i = 1; i < N; i++) {
  25. if (max < array[i]) {max=array[i];};
  26. };
  27. fout << max;
  28. }
  29. return 0;
  30. }
Add Comment
Please, Sign In to add comment