제출 #879319

#제출 시각아이디문제언어결과실행 시간메모리
87931912345678Two Antennas (JOI19_antennas)C++17
13 / 100
62 ms31200 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...