Guest User

Untitled

a guest
Jun 19th, 2018
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.91 KB | None | 0 0
  1. #include <iostream>
  2. #include <vector>
  3. #define INF 1234567890
  4. using namespace std;
  5. int T, test_case, Answer, N, K;
  6.  
  7. int main() {
  8. cin >> T;
  9. for(test_case = 1; test_case <= T; test_case++) {
  10. Answer = 0;
  11. cin >> N;
  12. vector<int> a(N + 1);
  13. a[0] = 0; // 좌표 0
  14. for(int i = 1; i <= N; i++) cin >> a[i];
  15. a.push_back(INF);
  16. cin >> K;
  17. int start = 0;
  18. int tmp = 1;
  19. while(true) {
  20. if(start == N) break;
  21. int here = a[start];
  22. int next = a[tmp];
  23. if(next - here <= K) {
  24. if(a[tmp + 1] - here > K) {
  25. Answer++;
  26. start = tmp;
  27. }
  28. tmp++;
  29. } else {
  30. Answer = -1;
  31. break;
  32. }
  33. }
  34. cout << "Case #" << test_case << "\n";
  35. cout << Answer << "\n";
  36. }
  37. return 0;
  38. }
Add Comment
Please, Sign In to add comment