Cod sursa(job #2953525)

Utilizator teodorescunicolasteodorescu nicolas alexandru teodorescunicolas Data 11 decembrie 2022 17:03:45
Problema Infasuratoare convexa Scor 0
Compilator c-64 Status done
Runda Arhiva educationala Marime 1.17 kb
#include <stdio.h>
#include <stdlib.h>

#define NMAX 120000

struct ura {
  double x;
  double y;
} v[NMAX];

int f[NMAX]; ///daca apare in infasuratoare sau nu

int main() {
    FILE *fin, *fout;
    fin = fopen("infasuratoare.in", "r");
    fout = fopen("infasuratoare.out", "w");

    int n, min, i, j, pctop, minx, miny, xop, yop, ant, acm;

    fscanf(fin, "%d", &n);

    min = 1000000001;
    for (i=0; i<n; i++) {
        fscanf(fin, "%lf%lf", &v[i].x, &v[i].y);
        if (min > v[i].y) {
            min = v[i].y;
            j = i;
        }
    }
    f[j] = 1;
    pctop = j;
    xop = v[j].x;
    yop = v[j].y;

    if (pctop == 0) {
        minx = v[1].x;
        miny = v[1].y;
    } else {
        minx = v[0].x;
        miny = v[0].y;
    }
    for (i=0; i<n; i++) {
        if (i!=pctop) {
            if ((miny-yop)*(v[i].x-xop) > (minx-xop)*(v[i].y-yop)) {
                minx = v[i].x;
                miny = v[i].y;
                j = i;
            }
        }
    }
    f[j] = 1;

    acm = j;
    ant = pctop;

    for (i=0; i<n; i++) {

    }







    fclose(fin);
    fclose(fout);
    return 0;
}