Maximum possible intersection by moving centers of line segments in C++

In this tutorial, we will be discussing a program to find maximum possible intersection by moving centers of line segments

For this we will be provided with the center of three line segments and their length. Our task is to move their center by K distance to increase the length of intersection region.

Example

 Live Demo

#include <bits/stdc++.h>
using namespace std;
//finding maximum intersection
int max_intersection(int* center, int length, int k) {
   sort(center, center + 3);
   if (center[2] - center[0] >= 2 * k + length) {
      return 0;
   }
   else if (center[2] - center[0] >= 2 * k) {
      return (2 * k - (center[2] - center[0] - length));
   }
   else
      return length;
}
int main() {
   int center[3] = { 1, 2, 3 };
   int L = 1;
   int K = 1;
   cout << max_intersection(center, L, K);
}

Output

1

Ayush Gupta

Published on 09-Sep-2020 12:21:51

• Related Questions & Answers
• How do I find the intersection of two line segments in Matplotlib?
• Maximum number of parallelograms that can be made using the given length of line segments in C++
• Maximum points of intersection n circles in C++
• Maximum points of intersection n lines in C++
• Maximum number of segments of lengths a, b and c in C++
• Centers of a tree
• Check if two line segments intersect
• Klee’s Algorithm (Length Of Union Of Segments of a line) in C++
• Maximum number of segments that can contain the given points in C++
• Maximum length of segments of 0’s and 1’s in C++
• Find Maximum number possible by doing at-most K swaps in C++
• C++ program to find the number of triangles amongst horizontal and vertical line segments
• Possible cuts of a number such that maximum parts are divisible by 3 in C++
• Read file line by line using C++
• Find all disjointed intersections in a set of vertical line segments in JavaScript