#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int MAXN = 1e5; const ll INF = 1e18; int N; ll S, E, D, A; ll T[MAXN+10], B[MAXN+10]; ll dp[MAXN+10]; struct BIT { ll tree[MAXN+10]; vector<ll> comp; BIT() { for(int i=0; i<MAXN+10; i++) tree[i]=-INF; } void uniq() { sort(comp.begin(), comp.end()); comp.erase(unique(comp.begin(), comp.end()), comp.end()); } void update(ll i, ll x) { for(; i<=comp.size(); i+=(i&-i)) tree[i]=max(tree[i], x); } ll query(ll i) { ll ret=-INF; for(; i>0; i-=(i&-i)) ret=max(ret, tree[i]); return ret; } ll getcomp(ll x) { return upper_bound(comp.begin(), comp.end(), x)-comp.begin(); } void update2(ll i, ll x) { update(getcomp(i), x); } ll query2(ll i) { return query(getcomp(i)); } }bitl, bitr; int main() { int i, j; scanf("%lld%lld%lld%lld%d", &S, &E, &D, &A, &N); for(i=1; i<=N; i++) scanf("%lld%lld", &T[i], &B[i]); T[0]=S; T[N+1]=E; for(i=0; i<=N+1; i++) bitl.comp.push_back(T[i]%D+1); for(i=0; i<=N+1; i++) bitr.comp.push_back(D-T[i]%D); bitl.uniq(); bitr.uniq(); for(i=0; i<=N+1; i++) { if(i) dp[i]=max(bitl.query2(T[i]%D)-A, bitr.query2(D-T[i]%D))+B[i]-A*(T[i]/D); else dp[i]=0; bitl.update2(T[i]%D+1, dp[i]+A*(T[i]/D)); bitr.update2(D-T[i]%D, dp[i]+A*(T[i]/D)); } printf("%lld\n", dp[N+1]); }

koala.cpp: In member function 'void BIT::update(ll, ll)':
koala.cpp:27:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  void update(ll i, ll x) { for(; i<=comp.size(); i+=(i&-i)) tree[i]=max(tree[i], x); }
                                  ~^~~~~~~~~~~~~
koala.cpp: In function 'int main()':
koala.cpp:40:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
koala.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld%lld%d", &S, &E, &D, &A, &N);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
koala.cpp:43:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%lld%lld", &T[i], &B[i]);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~