Lưu ý: Các code mẫu dưới đây chỉ mang tính tham khảo và có thể không AC được bài tập này

Code mẫu của ladpro98

#include <bits/stdc++.h>
#define dd pair<double, double>
#define X first
#define Y second
const int N = 202;
const double oo = 10000000000000.0;
using namespace std;
double F[N][N];
int n;
dd a[N];

double area(dd a, dd b, dd c) {
    return fabs(a.X * (b.Y - c.Y) + b.X * (c.Y - a.Y) + c.X * (a.Y - b.Y)) / 2;
}

int main()
{
    scanf("%d", &n);
    int i, j, k, len; double res1 = 0;
    for(i = 1; i <= n; i++) scanf("%lf %lf", &a[i].X, &a[i].Y);
    for(i = 1; i <= n; i++) for(j = i + 1; j <= n; j++)
        for(k = j + 1; k <= n; k++) res1 = max(res1, area(a[i], a[j], a[k]));
    for(len = 2; len <= n; len++) for(i = 1; i <= n - len; i++) {
        j = i + len; F[i][j] = oo;
        for(k = i + 1; k < j; k++)
            F[i][j] = min(F[i][j], max(max(F[i][k], F[k][j]), area(a[i], a[k], a[j])));
    }
    printf("%.1lf\n", res1); printf("%.1lf", F[1][n]);
    return 0;
}

Code mẫu của RR

{$R-,Q-}
uses math;
const
  FINP='';
  FOUT='';
  MAXN=200;
var
  f1,f2:text;
  s:array[1..MAXN,1..MAXN,1..MAXN] of double;
  d:array[1..MAXN,1..MAXN] of double;
  x,y:array[1..MAXN] of double;
  n:longint;
procedure openF; inline;
begin
  assign(f1,FINP); reset(f1);
  assign(f2,FOUT); rewrite(f2);
end;
procedure closeF; inline;
begin
  close(f1); close(f2);
end;
procedure inp; inline;
var
  i:longint;
begin
  read(f1,n);
  for i:=1 to n do
    read(f1,x[i],y[i]);
end;
procedure solve;
var
  i,j,k,c:longint;
  kq:double;
begin
  kq:=0;
  for i:=1 to n-2 do
  for j:=i+1 to n-1 do
  for k:=j+1 to n do
    begin
      s[i,j,k]:=abs(x[i]*y[j]-y[i]*x[j]+x[j]*y[k]-y[j]*x[k]+x[k]*y[i]-x[i]*y[k]);
      kq:=max(kq,s[i,j,k]);
    end;
  writeln(f2,kq/2:0:1);
  for k:=2 to n-1 do
  for i:=1 to n-k do
    begin
      j:=i+k; d[i,j]:=4e12;
      for c:=i+1 to j-1 do
        d[i,j]:=min(d[i,j],max(max(d[i,c],d[c,j]),s[i,c,j]));
    end;
  writeln(f2,d[1,n]/2:0:1);
end;
begin
  openF;
  inp;
  solve;
  closeF;
end.

Code mẫu của hieult

#include <cstdio>
#include <iostream>
//#include <conio.h>

struct point
{   double x,y; };

point A[210];
int n;
double f[210][210];

double TTD(double x) { return x>0 ? x:-x ;}

double area(int i, int j, int k)
{
     return TTD(((A[i].x*A[j].y-A[j].x*A[i].y)+(A[j].x*A[k].y-A[k].x*A[j].y)+(A[k].x*A[i].y-A[i].x*A[k].y))/2);}

double max(double a,double b,double c)
{
       if(a>b && a>c) return a;
       if(b>c && b>a) return b; return c; }

int main()
{
    //freopen("NKPOLY.in","r",stdin);
    scanf("%d",&n);
    double KQmax =0 ,rich,u=100000000,v=100000000;
    int i,j,t,hieu,k;
    for(i = 1;i<=n;i++)
        scanf("%lf %lf",&A[i].x,&A[i].y);
    for(i = 1;i<=n;i++)
        for(j = i+1;j<=n;j++)
           for(k = j+1;k<=n;k++)
           {
               rich = area(i,j,k); 
               if(rich>KQmax)
                    KQmax = rich;
           } 
    for(i = 1;i<=n-1;i++) {f[i][i] = 0; f[i][i+1] = 0;}
    f[n][n] = 0;f[n][1]=0;
    for(hieu = 2;hieu<=n-1;hieu++)
    {
        for(i = 1;i<=n;i++)
        {
             j = (i+hieu-1)%n+1;
             f[i][j] = u*v;
             if(j>i)
             {
                  for(t = i+1;t<j;t++)
                  {
                      rich = max(f[i][t],f[t][j],area(i,t,j));
                      if(f[i][j]>rich)
                          f[i][j] = rich;
                  }
             }
             else
             {
                  for(t = i+1;t<=n;t++)
                  {
                      rich = max(f[i][t],f[t][j],area(i,t,j));
                      if(f[i][j]>rich)
                          f[i][j] = rich;
                  }
                  for(t = 1;t<j;t++)
                  {
                      rich = max(f[i][t],f[t][j],area(i,t,j));
                      if(f[i][j]>rich)
                          f[i][j] = rich;
                  }
             }
        }
    }
    printf("%.1lf\n%.1lf\n",KQmax,f[2][1]); 
   // getch();               
}

Code mẫu của khuc_tuan

import java.util.*;
import java.io.*;
import java.math.*;

public class Main {

    static long[] x, y;
    static long[][] F;

    static long S(int i,int j,int k) {
        return Math.abs((x[i]-x[j])*(y[i]+y[j])+(x[j]-x[k])*(y[j]+y[k])+(x[k]-x[i])*(y[k]+y[i]));
    }

    static long tinh(int i,int j) {
        if(i+1>=j) return 0;
        if(F[i][j]!=-1) return F[i][j];
        int t = i+1;
        long res = 1000000000000000L;
        for(;t<j;++t) {
            res = Math.min( res, Math.max(tinh(i,t), Math.max( tinh(t,j), S(i,j,t)) ));
        }
        return F[i][j] = res;
    }

    public static void main(String[] args) throws Exception {
        BufferedReader kb = new BufferedReader( new InputStreamReader(System.in));
        int n = Integer.parseInt(kb.readLine());
        StringTokenizer st;
        x = new long[n];
        y = new long[n];
        for(int i=0;i<n;++i) {
            st = new StringTokenizer(kb.readLine());
            x[i] = Long.parseLong(st.nextToken());
            y[i] = Long.parseLong(st.nextToken());
        }
        long max = 0;
        for(int i=0;i<n;++i) for(int j=i+1;j<n;++j) for(int k=j+1;k<n;++k) max = Math.max( max, S(i,j,k));
        System.out.printf("%.1f\n", max/2.0);
        F = new long[n][n];
        for(long[] aa : F) Arrays.fill( aa, -1);
        long res2 = tinh(0,n-1);
        System.out.printf("%.1f\n", res2/2.0);
    }
}