fork(2) download
  1.  
  2. #include <iostream>
  3.  
  4. using namespace std;
  5.  
  6. int main()
  7. {
  8. int T;
  9. int n;
  10. int* rungs;
  11. int str;
  12. cin >> T;
  13. for (int i = 1; i <= T; i++)
  14. {
  15. cout << "Case " << i << ": ";
  16. cin >> n;
  17. rungs = new int[n+1];
  18. rungs[0] = 0;
  19. for (int j = 0; j <= n-1; j++)
  20. {
  21. cin >> rungs[j+1];
  22. }
  23. str = -1;
  24. for (int jump = n; jump >= 0; jump--)
  25. {
  26. if (rungs[jump+1] - rungs[jump] == str)
  27. str += 1;
  28. else if (rungs[jump+1] - rungs[jump] > str)
  29. str = rungs[jump+1] - rungs[jump];
  30. }
  31. cout << str << endl;
  32. delete [] rungs;
  33. }
  34. return 0;
  35. }
  36.  
Success #stdin #stdout 0s 2988KB
stdin
2
5
1 6 7 11 13
4
3 9 10 14
stdout
Case 1: 5
Case 2: 135099