diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-15 21:47:41 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-15 21:47:41 +0200 |
| commit | af320060fc0a5bd574ae2bcd6c5032a70b1ec679 (patch) | |
| tree | ff235f12186cc4dab753e81a7b7cadf6e18cca95 | |
| parent | a3bb13b641af09c85a2497ad2f88502585d673aa (diff) | |
| download | competitive-programming-af320060fc0a5bd574ae2bcd6c5032a70b1ec679.tar.xz competitive-programming-af320060fc0a5bd574ae2bcd6c5032a70b1ec679.zip | |
Solved ConsecutivePointSegment from codeforces
| -rw-r--r-- | ConsecutivePointsSegment.cpp | 31 |
1 files changed, 31 insertions, 0 deletions
diff --git a/ConsecutivePointsSegment.cpp b/ConsecutivePointsSegment.cpp new file mode 100644 index 0000000..f0d2b4c --- /dev/null +++ b/ConsecutivePointsSegment.cpp @@ -0,0 +1,31 @@ +#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; + } + } + } +} |
