Cod sursa(job #3298574)

Utilizator stefan1010Stefan Bogdan stefan1010 Data 31 mai 2025 12:28:25
Problema Infasuratoare convexa Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.27 kb
#include <fstream>
#include <iostream>
#include <algorithm>
#include <iomanip>
#define NMAX 120010
using namespace std;
ifstream fin("infasuratoare.in");
ofstream fout("infasuratoare.out");

struct punct
{
  double x,y;
}v[NMAX];

struct dreapta
{
  punct a,b;
};

bool este_la_dreapta_lui_d(punct c,dreapta d)
{
  double x_a=d.a.x, x_b=d.b.x, x_c=c.x, y_a=d.a.y, y_b=d.b.y, y_c=c.y;
  double S=x_a*y_b + x_b*y_c + x_c*y_a - y_b*x_c - y_c*x_a - y_a*x_b;
  if(S<0)
    return true;
  else
    return false;
}
bool cmp(punct a,punct b)
{
  if(a.x>b.x)
    return false;
  else
    if(a.x<b.x)
      return true;
    else
        if(a.y>b.y)
          return false;
        else
          return true;
}
int n;
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
      fin>>v[i].x>>v[i].y;
    }
    sort(v+1,v+n+1,cmp);
    punct stangajos=v[1],dreaptasus=v[n];
    int k1=0,k2=0;
    punct st1[NMAX],st2[NMAX];
    dreapta extrema;
    extrema.a=stangajos;
    extrema.b=dreaptasus;
    for(int i=2;i<n;i++)
    {
      bool la_dreapta=este_la_dreapta_lui_d(v[i],extrema);
      if(la_dreapta==true)///punct de jos, prima stiva
      {

      }
      else///punct de sus, a doua stiva
      {

      }
    }
    return 0;
}