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 flashmt

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <utility>
#define oo 1000000000
using namespace std;

int m,n,leaf[10100],best[10100];
vector < pair<int,int> > machine;

int main()
{
    int x,y;
    cin >> n >> m;
    for (int i=1;i<=n;i++) scanf("%d",&leaf[i]), best[i]=oo;
    for (int i=0;i<m;i++) scanf("%d%d",&x,&y), machine.push_back(make_pair(x*2,y));
    sort(leaf+1,leaf+n+1);
    sort(machine.begin(),machine.end());
    m=0;
    for (int i=1;i<machine.size();i++)
    {
        while (m>=0 && machine[i].second<=machine[m].second) m--;
        if (m>=0)
        {
            x=(machine[i].first+machine[m].first-1)/machine[m].first;
            if (1LL*x*machine[m].second<=machine[i].second) continue;
        }
        machine[++m]=machine[i];
    }
    for (int i=1;i<=n;i++)
    {
        int ii=i;
        for (int j=0;j<=m && ii && machine[j].second<best[i];j++)
        {
            while (ii && leaf[i]-leaf[ii]<=machine[j].first) ii--;
            if (best[i]>best[ii]+machine[j].second) best[i]=best[ii]+machine[j].second;
        }
    }
    cout << best[n] << endl;
}

Code mẫu của ladpro98

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define ii pair<int, int>
const int N = 10104;
const int lim = 1010;
const int oo = 123456789;
using namespace std;
int x[N], machine[N], f[N];
vector<ii> mac;
int n, m;

int main()
{
    scanf("%d %d\n", &n, &m);
    int i, j, pos, d, c;
    for(i=1; i<=n; i++) scanf("%d\n", &x[i]);
    sort(x+1, x+1+n);
    for(i=1; i<=m ;i++) {
        scanf("%d %d\n", &d, &c);
        machine[c] = max(machine[c], d + d);
    }
    for(i = 1; i <= c; i++) {
        if (machine[i] == 0) continue;
        mac.push_back(ii(machine[i], i));
    }
    sort(mac.begin(), mac.end(), greater<ii>());
    for(i = 1; i <= n; i++) {
        pos = 0; f[i] = oo;
        for(j=0; j < mac.size(); j++) {
            while (x[pos + 1] + mac[j].first < x[i]) pos++;
            f[i] = min(f[i], f[pos] + mac[j].second);
        }
    }
    printf("%d", f[n]);
    return 0;
}

Code mẫu của RR

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <complex>

#define FOR(i,a,b) for(int i = a; i <= b; ++i)
#define FORD(i,a,b) for(int i = a; i >= b; --i)
#define REP(i,a) for(int i = 0; i < a; ++i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
using namespace std;

int n, m, x[10111], f[10111];
pair<int,int> d[10111];

int main() {
    scanf("%d%d", &n, &m);
    FOR(i,1,n) scanf("%d", &x[i]);
    FOR(i,1,m) {
        scanf("%d%d", &d[i].F, &d[i].S);
        d[i].F <<= 1;
    }

    sort(x+1, x+n+1);
    sort(d+1, d+m+1);

    f[0] = 0;
    FOR(i,1,n) {
        f[i] = 1000111000;
        int j = i-1;
        FOR(k,1,m) {
            while (j && x[j] >= x[i] - d[k].F) --j;
            f[i] = min(f[i], f[j] + d[k].S);
        }
    }
    cout << f[n] << endl;
    return 0;
}

Code mẫu của hieult

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(typeof(n) i = 0; i < (n); ++i)
#define Repd(i,n) for(typeof(n) i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(typeof(b) i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(typeof(a) i = (a); i >= (b); --i)
#define Fit(i,v) for(typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define Fitd(i,v) for(typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))
#define nl puts("")
#define sp printf(" ")
#define ok puts("ok")
//#include <conio.h>

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> void db(T a, int p = -1) { if (p >= 0) cout << fixed << setprecision(p); cout << a << " "; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> struct Triple { T x, y, z; Triple() {} Triple(T _x, T _y, T _z) : x(_x), y(_y), z(_z) {} };
template<class T> Triple<T> euclid(T a, T b) { if (b == 0) return Triple<T>(1, 0, a); Triple<T> r = euclid(b, a % b); return Triple<T>(r.y, r.x - a / b * r.y, r.z); }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return s == 0 ? 0 : cntbit(s >> 1) + (s & 1); }
const int bfsz = 1 << 16; char bf[bfsz + 5]; int rsz = 0;int ptr = 0;
char gc() { if (rsz <= 0) { ptr = 0; rsz = fread(bf, 1, bfsz, stdin); if (rsz <= 0) return EOF; } --rsz; return bf[ptr++]; }
void ga(char &c) { c = EOF; while (!isalpha(c)) c = gc(); }
int gs(char s[]) { int l = 0; char c = gc(); while (isspace(c)) c = gc(); while (c != EOF && !isspace(c)) { s[l++] = c; c = gc(); } s[l] = '\0'; return l; }
template<class T> bool gi(T &v) {
    v = 0; char c = gc(); while (c != EOF && c != '-' && !isdigit(c)) c = gc(); if (c == EOF) return false; bool neg = c == '-'; if (neg) c = gc();
    while (isdigit(c)) { v = v * 10 + c - '0'; c = gc(); } if (neg) v = -v; return true;
}

const double PI = 2 * acos(0);
const string months[] = {"January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"};
const int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dr[] = {-1, 0, +1, 0};
const int dc[] = {0, +1, 0, -1};
const int inf = (int)1e9 + 5;
const ll linf = (ll)1e16 + 5;
const double eps = 1e-9;
const ll mod = 100000007;
typedef pair<int, int> II;

#define maxn 10005

int x[maxn], n, m, f[maxn];
II A[maxn], P[maxn];

int main() {
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
    scanf("%d %d", &n, &m);
    Rep(i, n) scanf("%d", &x[i]); sort(x, x + n);
    Rep(i, m) scanf("%d %d", &P[i].se, &P[i].fi); sort(P, P + m);
    A[0] = P[0];
    int run = 1;
    For(i, 1, m - 1){
        if(P[i].se > A[run - 1].se) A[run++] = P[i];
    }
    f[0] = 0;
    For(i, 1, n){
        f[i] = f[i - 1] + A[0].fi;
        run = 0;
        for(int j = i - 1; j > 0; j--){
            while(A[run].se * 2 + 1 < x[i - 1] - x[j - 1] && run < m) run++;
            if(run == m) break;
            f[i] = min(f[i], f[j - 1] + A[run].fi);
        }
    }
    printf("%d\n", f[n]);
}