Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
maximize the difference
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
#include <iostream> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ll long long #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> int main() { ordered_set oset; int n; cin>>n; vector<ll> a(n+1),pre(n+1); for(int i=0;i<n;i++) { cin>>a[i]; } for(int i=0;i<n;i++) { pre[i]=i-(oset.order_of_key(a[i])); oset.insert(a[i]); }oset.clear(); for(int i=n-1;i>=0;i--) { pre[i]-=(oset.order_of_key(a[i])); oset.insert(a[i]); }ll ans=0; for(int i=1;i<n-1;i++) { ans=max(ans,pre[i]); }cout<<ans; }
g++
Show compiler warnings
[
+
] Compiler args
[
+
]
Show input
edit mode
|
history
|
discussion