Submission #1074500

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;

int n;
lint p, q, a[100005];
lint d12[100005], d21[100005];
int lo1[100005], lo2[100005];

struct seg{
	lint tree[100010];
	void add(int x, lint v){
		while(x <= n+5){
			tree[x] += v;
			tree[x] %= mod;
			x += x & -x;
		}
	}
	lint query(int x){
		lint ret = 0;
		while(x){
			ret += tree[x];
			ret %= mod;
			x -= x & -x;
		}
		return ret;
	}
	lint query(int s, int e){
		if(s > e) return 0;
		return (query(e) - query(s-1) + mod) % mod;
	}
}bit1, bit2;

int main(){
	cin >> n >> p >> q;
	for(int i=1; i<=n; i++){
		scanf("%lld",&a[i]);
	}
	int l1 = n, l2 = n;
	if(p > q) swap(p, q);
	for(int i=n; i; i--){
		if(a[i+1] - a[i] < p) l1 = i;
		if(a[i+1] - a[i] < q) l2 = i;
		lo1[i] = l1;
		lo2[i] = l2;
	}
	lint ret = 0;
	for(int i=n; i>1; i--){
		if(lo1[i] == n) d21[i] = 1;
		if(lo2[i] == n) d12[i] = 1;
		int lb1 = lower_bound(a+1, a+n+1, a[i-1] + p) - a;
		int lb2 = lower_bound(a+1, a+n+1, a[i-1] + q) - a;
		lb1 = max(lb1, i+1);
		lb2 = max(lb2, i+1);
		d12[i] += bit2.query(lb1, lo2[i] + 1);
		d21[i] += bit1.query(lb2, lo1[i] + 1);
		d12[i] %= mod;
		d21[i] %= mod;
		bit1.add(i, d12[i]);
		bit2.add(i, d21[i]);
		if(lo1[1] >= i-1) ret += d12[i];
		if(lo2[1] >= i-1) ret += d21[i];
	}
	cout << ret % mod << endl;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[i]);
                      ^

Judge Result