关于 TLE

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 20, MAXM = 5e5 + 10;

int n, a[N], M;
bool f[MAXM];
ll l, r, g[MAXM];

void Get() {
    if (!M) return ;
    fill(g, g + M, 1e18), g[0] = 0;
    for (int i = 1; i <= n; i++) {
        fill(f, f + M, 0);
        int now = a[i] % M;
        for (int j = 0; j < M; j++) {
            if (f[j]) continue;
            int k = j, st = 0; ll mmin = 1e18;
            while (1) {
                if (mmin > g[k]) mmin = g[k], st = k;
                k += now, k -= (k >= M ? M : 0);
                if (k == j) break;
            }
            k = st;
            while (!f[k]) {
                g[k] = min(g[k], mmin), mmin = min(mmin, g[k]) + a[i];
                f[k] = 1, k += now, k -= (k >= M ? M : 0);
            }
        }
    }
}

ll Solve(ll x) {
    ll ret = 0;
    for (int i = 0; i < M; i++) {
        if (x >= g[i]) ret += max(0ll, (x - g[i]) / M + 1);
    }
    return ret;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> l >> r;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        if (!M) M = a[i];
    }
    Get(), cout << (!M ? 0 : Solve(r) - Solve(l - 1));
    return 0;
}

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 20, MAXM = 5e5 + 10;

int n, a[N], M;
bool f[MAXM];
ll l, r, g[MAXM];

void Get() {
    if (!M) return ;
    fill(g, g + M, 1e18), g[0] = 0;
    for (int i = 1; i <= n; i++) {
        fill(f, f + M, 0);
        int now = a[i] % M;
        for (int j = 0; j < M; j++) {
            if (f[j]) continue;
            ll mmin = 1e18;
            for (int k = j, cnt = 0; cnt < 2; cnt += j == k) {
                g[k] = min(g[k], mmin), mmin = min(mmin, g[k]) + a[i];
                f[k] = 1, k += now, k -= (k >= M ? M : 0);
            }
        }
    }
}

ll Solve(ll x) {
    ll ret = 0;
    for (int i = 0; i < M; i++) {
        if (x >= g[i]) ret += max(0ll, (x - g[i]) / M + 1);
    }
    return ret;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> l >> r;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        if (!M) M = a[i];
    }
    Get(), cout << (!M ? 0 : Solve(r) - Solve(l - 1));
    return 0;
}