# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856916 | Tudy006 | Climbers (RMI18_climbers) | C++17 | 41 ms | 195924 KiB |
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 NMAX = 5000;
const long long INF = 1e18;
priority_queue <pair<long long, pair<int, int>>> pq;
long long modul( long long x ) {return x < 0 ? -x : x;}
bool between( int a, int b, int c ) {return ( a <= b && b <= c ) || ( a >= b && b >= c );}
long long dist[NMAX + 1][NMAX + 1];
void update( int i, int j, long long d ) {
if ( d < dist[i][j] ) {
dist[i][j] = d;
pq.push( { -d, { i, j } } );
}
}
int main() {
int n;
cin >> n;
vector <int> v;
for ( int i = 1, x; i <= n; i ++ ) {
cin >> x;
v.push_back( x ) ;
while ( v.size() >= 3 && between( v[v.size() - 3], v[v.size() - 2], v[v.size() - 1] ) ) v.pop_back();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |