Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
maximize the difference
#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; }
run
|
edit
|
history
|
help
0
12535
Zscore
Assigment operator (easy)
always_late
СПКИ АП КЭП 2
Bin Tree playground
PriQTel2
Array Subset of another array
k-tree 431 C
LRUCache