90pts 求调

#include <bits/stdc++.h>
#define int long long
using namespace std;

using i32 = int32_t;
using i64 = int64_t;
using ui32 = uint32_t;
using ui64 = uint64_t;

namespace strdp {
	const int N = 3e5, mod = 1e9 + 7;
	int n, a[N + 5], b[N + 5], lst[N + 5];
	struct fenw {
		int tree[N + 5];
		void update(int x, int k) {
			for (int i = x; i <= n; i += i & -i) tree[i] = (tree[i] + k) % mod;
		}
		int query(int x) {
			int res = 0;
			for (int i = x; i >= 1; i -= i & -i) res = (res + tree[i]) % mod;
			return res;
		}
	} t;
	void main() {
		cin >> n;
		for (int i = 1; i <= n; i++) cin >> a[i], b[i] = a[i];
		sort(b + 1, b + n + 1);
		int cnt = unique(b + 1, b + n + 1) - (b + 1);
		for (int i = 1; i <= n; i++) a[i] = lower_bound(b + 1, b + cnt + 1, a[i]) - b;
		int res = 0;
		for (int i = 1; i <= n; i++) {
			int q = t.query(a[i] - 1);
			t.update(a[i], q - lst[a[i]]);
			if (!lst[a[i]]) t.update(a[i], 1);
			res = (res - lst[a[i]] + q) % mod;
			lst[a[i]] = q;
		}
		cout << (res + mod) % mod << "\n";
	}
}

i32 main() {

	int t = 1;
	// cin >> t;

	while (t--) strdp::main();
	return 0;
}