This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int nx=2e3+5;
int n, dp[nx][nx], h[nx], a[nx], b[nx], q, l, r;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n; i++) cin>>h[i]>>a[i]>>b[i], dp[i][i]=-1;
for (int k=1; k<=n; k++) for (int i=1; i<=n; i++) dp[i][i+k]=max({dp[i+1][i+k], dp[i][i+k-1], (a[i]<=k&&k<=b[i]&&a[i+k]<=k&&k<=b[i+k])?abs(h[i]-h[i+k]):-1});
cin>>q;
while (q--) cin>>l>>r, cout<<dp[l][r]<<'\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |