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 <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <ctime>
#include <memory.h>
#include <cassert>

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, a, b) for(int i = (a); i <=(b); ++i)
#define FORD(i, a, b) for(int i = (a); i > (b); --i)
#define REPD(i, a, b) for(int i = (a); i >=(b); --i)
#define TR(it, a) for(typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define RESET(a, v) memset(a, (v), sizeof(a))
#define SZ(a) (int(a.size()))
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define LL long long
#define LD long double
#define II pair<int, int>
#define X first
#define Y second
#define VI vector<int>
#define VII vector<II>
#define endl '\n'

const int INF = 1000000000;
const int T = 111;
const int N = 10101;

using namespace std;

int n, k, nBalls, timeLimit;
int f[T][N], cntBalls[T][N];

void push(deque<int> &Q, int i, int j) {
    while (!Q.empty() && f[i][Q.back()] <= f[i][j]) Q.pop_back();
    Q.push_back(j);
}

int main() {
    ios :: sync_with_stdio(0); cin.tie(0);
    cin >> n >> k >> nBalls;
    int t, x;
    while (nBalls--) {
        cin >> t >> x;
        ++cntBalls[t][x];
        timeLimit = max(timeLimit, t);
    }
    REP(i, 1, timeLimit) {
        deque<int> Q;
        REP(j, 1, k) push(Q, i - 1, j);
        REP(j, 1, n) {
            while (!Q.empty() && Q.front() < j - k) Q.pop_front();
            if (j + k <= n) push(Q, i - 1, j + k);
            f[i][j] = f[i - 1][Q.front()] + cntBalls[i][j];
        }
    }
    int ans = 0;
    REP(i, 1, n) ans = max(ans, f[timeLimit][i]);
    cout << ans << endl;
    return 0;
}

Code mẫu của RR

//Written by Nguyen Thanh Trung
{$IFDEF RR}
  {$R+,Q+}
  {$Mode objFPC}
  {$inline off}
{$ELSE}
  {$R-,Q-}
  {$Mode objFPC}
  {$inline on}
{$ENDIF}
uses math;
const
  FINP          =       {$IFDEF RR}'input.txt';  {$ELSE} ''; {$ENDIF}
  FOUT          =       {$IFDEF RR}'output.txt'; {$ELSE} ''; {$ENDIF}
  MAXN          =       20111;
  MAXT          =       111;
var
  f1,f2         :       text;
  n,k,s         :       longint;
  f             :       array[0..1,1..MAXN] of longint;
  left,right    :       array[0..MAXN] of longint;
  count         :       array[1..MAXT,1..MAXN] of longint;

procedure openF;
    begin
      assign(f1,FINP); reset(f1);
      assign(f2,FOUT); rewrite(f2);
    end;
procedure closeF;
    begin
      close(f1);
      close(f2);
    end;
procedure inp;
    var
      u,t:longint;
    begin
      read(f1,n,k,s);
      for s:=1 to s do
        begin
          read(f1,t,u);
          inc(count[t,u]);
        end;
    end;
procedure solve;
    var
      t,i,now,kk:longint;
    begin
      kk:=k<<1+1; while n mod kk>0 do inc(n);
      for t:=1 to MAXT do
        begin
          now:=t and 1;
          for i:=1 to n do
            f[now,i]:=max( right[max(0,i-k)] , left[min(n+1,i+k)] )+count[t,i];
          for i:=1 to n do
            if i mod kk=1 then left[i]:=f[now,i]
            else left[i]:=max(left[i-1],f[now,i]);
          for i:=n downto 1 do
            if i mod kk=0 then right[i]:=f[now,i]
            else right[i]:=max(right[i+1],f[now,i]);
          {$IFDEF RR}
            writeln(f2,'time=',t);
            write(f2,'count = '); for i:=1 to n do write(f2,count[t,i]:3); writeln(f2);
            write(f2,'f =     '); for i:=1 to n do write(f2,f[now,i]:3); writeln(f2);
            write(f2,'left =  '); for i:=1 to n do write(f2,left[i]:3);  writeln(f2);
            write(f2,'right = '); for i:=1 to n do write(f2,right[i]:3); writeln(f2);
            writeln(f2);
          {$ENDIF}
        end;
      kk:=1;
      for i:=1 to n do
        if f[now,i]>f[now,kk] then kk:=i;
      writeln(f2,f[now,kk]);
    end;
begin
  openF;
  inp;
  solve;
  closeF;
end.

Code mẫu của hieult

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

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

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#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 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))

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> 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> 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 = (int) 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;
}

typedef pair<int, int> II;

const ld PI = acos(-1.0);
const ld eps = 1e-9;

const int dr[] = {0, +1, 0, -1};
const int dc[] = {+1, 0, -1, 0};

const int inf = (int)1e9 + 5;
const ll linf = (ll)1e16 + 5;
const ll mod = (ll)1e9 + 7;

#define maxn 10005
#define maxt 105

int n, k, s;
int num[maxt][maxn];
int f[maxn], g[maxn];

int  main()
{
//  freopen("in.txt", "r", stdin);
    gi(n); gi(k); gi(s);
    ms(num, 0);
    int y, x;
    Rep(run, s){
        gi(y); gi(x);
        num[y][x]++;
    }

    ms(f, 0); ms(g, 0);
    int res = 0;
    For(run, 1, 100){
        For(i, 1, n) g[i] = f[i];
        multiset<int> S;
        multiset<int>::iterator it;
        For(i, 1, k) S.insert(g[i]);
        For(i, 1, n){
            if(i + k <= n) S.insert(g[i + k]);
            it = S.end(); it--;
            f[i] = num[run][i] + (*it);
            res = max(f[i], res);
            if(i > k) S.erase(S.find(g[i - k]));
        }
    }

    cout << res;

    return 0;
}

Code mẫu của ll931110

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;

int a[10002][102],f[10002][102];
int n,k,s;

int main()
{
//    freopen("per.in","r",stdin);
//    freopen("per.ou","w",stdout);
    scanf("%d %d %d", &n, &k ,&s);
    memset(a,0,sizeof(a));
    int max_time = 0;
    for (int i = 0; i < s; i++)
    {
        int x,y;
        scanf("%d %d", &x, &y);
        a[y][x]++;  max_time = max(max_time,x);
    };
    memset(f,0,sizeof(f));
    for (int j = max_time - 1; j >= 0; j--)
    {
        priority_queue< pair<int,int> > q;
        for (int i = 1; i <= min(n,k + 1); i++) q.push(make_pair(f[i][j + 1] + a[i][j + 1],i));
        for (int i = 1; i <= n; i++)
        {
            pair<int,int> pp;
            while (1)
            {
                  pp = q.top();  
                  if (pp.second >= i - k) break;
                  q.pop();
            };            
            f[i][j] = pp.first;  
            if (i + k < n) q.push(make_pair(f[i + k + 1][j + 1] + a[i + k + 1][j + 1],i + k + 1));
        };
    };
    int ret = 0;
    for (int i = 1; i <= n; i++) ret = max(ret,f[i][0]);
    printf("%d\n", ret);
};

Code mẫu của khuc_tuan

#include <iostream>
using namespace std;

int n, k, m;
int S[10010][111], F[111][10010], back[111][10010], next[111][10010];

int main() {
    scanf("%d%d%d", &n, &k, &m);
    for(int i=0;i<m;++i) {
        int t, x;
        scanf("%d%d", &t, &x);
        S[x][t] ++ ;
    }   
    for(int time=1;time<=100;++time) {
        for(int pos=1;pos<=n;++pos)
            F[time][pos] = S[pos][time] + ((pos <= k && pos + k > n) ? back[time][n] : max( pos > k ? next[time-1][pos-k] : 0, pos + k <= n ? back[time-1][pos+k] : 0));
        for(int pos=1;pos<=n;++pos) {
            back[time][pos] = F[time][pos];
            if(pos != 1 && pos % (2 * k + 1) != 0) back[time][pos] >?= back[time][pos-1];
        }
        for(int pos=n;pos>=1;--pos) {
            next[time][pos] = F[time][pos];
            if(pos != n && pos % (2 * k + 1) != 2 * k) next[time][pos] >?= next[time][pos + 1];
        }
    }
    cout << *max_element(F[100], F[100] + n + 1) << endl;
    return 0;
}