Submission #1774991

---

Source Code Expand

#include <bits/stdc++.h>
#define lsb(x) ((x) & -(x))
#define MOD 1000000007
using namespace std;

const long long NMAX = 100010;

inline void add(long long & a, long long b)
{
    a += b;
    if (a >= MOD)
        a -= MOD;
}
class Aib
{
    vector <long long> pozitii;
    vector <long long> aib;
public:
    Aib() {
        aib = vector <long long> (NMAX + 5);
    }
    void update(long long val, long long poz)
    {
        poz++;
        while (poz <= NMAX) {
            if (aib[poz] == 0)
                pozitii.push_back(poz);
            add(aib[poz], val);
            poz += lsb(poz);
        }
    }
    long long query(long long poz)
    {
        poz++;
        long long ans(0);
        while (poz) {
            add(ans, aib[poz]);
            poz -= lsb(poz);
        }
        return ans;
    }
    void clear()
    {
        for (auto i : pozitii)
            aib[i] = 0;
        pozitii.clear();
    }
};

Aib aib[2];

long long s[100010];
long long dif[2];

long long pozmax(long long x, long long dif)
{ /// poztia maxima a.i. s[x] - s[max] >= dif
    long long p(0), q(1 << 20);
    while (q >>= 1)
        if (p + q < x && s[x] - s[p + q] >= dif)
            p += q;
    return p;
}

void tranz(long long x)
{
    long long updates[2];
    for (long long i(0); i <= 1; i++) {
        updates[1 - i] = aib[i].query(pozmax(x + 1,  dif[1 - i]));
        if (s[x + 1] - s[x] < dif[i])
            aib[i].clear();
    }
    for (long long i(0); i <= 1; i++)
        aib[i].update(updates[i], x);
}

//long long dp[2][10][10];


int main()
{
    long long n;
    cin >> n >> dif[0] >> dif[1];

    for (long long i(1); i <= n; i++)
        cin >> s[i];

    aib[0].update(1, 0);
    aib[1].update(1, 0);

    /*for (long long q(0); q <= 1; q++) {
        for (long long j(0); j <= n; j++) {
            dp[q][1][j] = aib[q].query(j) - aib[q].query(j - 1);
        }
    }*/

    for (long long i(1); i < n; i++) {
        tranz(i);
        /*for (long long q(0); q <= 1; q++) {
            for (long long j(0); j <= n; j++) {
                dp[q][i + 1][j] = aib[q].query(j) - aib[q].query(j - 1);
            }
        }
    }

    for (long long q(0); q <= 1; q++) {
        for (long long i(1); i <= n; i++) {
            for (long long j(0); j <= n; j++) {
                cout << dp[q][i][j] << " \n"[j == n];
            }
        }
        cout << '\n';*/
    }

    cout << (aib[0].query(n) + aib[1].query(n)) % MOD;
    return 0;
}

Submission Info

Judge Result