aboutsummaryrefslogtreecommitdiff
path: root/ConsecutivePointsSegment.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /ConsecutivePointsSegment.cpp
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'ConsecutivePointsSegment.cpp')
-rw-r--r--ConsecutivePointsSegment.cpp31
1 files changed, 0 insertions, 31 deletions
diff --git a/ConsecutivePointsSegment.cpp b/ConsecutivePointsSegment.cpp
deleted file mode 100644
index f0d2b4c..0000000
--- a/ConsecutivePointsSegment.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-int main() {
- int tt;
- cin >> tt;
- while(tt--) {
- int n;
- int gapSize = 0;
- int gap = 0;
- cin >> n;
- vector<int> v(n);
- for(int& x : v) cin >> x;
- for(int i = 0; i < n - 1; i++) {
- if(v[i+1] - v[i] > 1) {
- gapSize += v[i+1] - v[i];
- gap++;
- }
- }
- if(gap > 2) {
- cout << "NO" << endl;
- } else {
- if(gapSize >= 5 && gap == 2) {
- cout << "NO" << endl;
- } else if(gap == 1 && gapSize >= 4){
- cout << "NO" << endl;
- } else {
- cout << "YES" << endl;
- }
- }
- }
-}