# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653177 | guagua0407 | Zoltan (COCI16_zoltan) | C++17 | 199 ms | 33896 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;
#define ll long long
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const ll mxn=2e5+5;
const ll mod=1e9+7;
ll arr[mxn];
ll id[mxn];
map<ll,ll> num;
ll MX=0;
pair<ll,ll> segtree[mxn][2];
ll fpow(ll a,ll b){
ll ans=1;
while(b>0){
if(b&1) ans=(ans*a)%mod;
a=(a*a)%mod;
b/=2;
}
return ans;
}
pair<ll,ll> comb(pair<ll,ll> a,pair<ll,ll> b){
if(a.f==b.f){
return {a.f,a.s+b.s};
}
return max(a,b);
}
void update(ll pos,pair<ll,ll> val,ll k,ll l=1,ll r=MX,ll v=1){
if(l==r){
segtree[v][k]=comb(segtree[v][k],val);
return;
}
ll mid=(l+r)/2;
if(pos<=mid) update(pos,val,k,l,mid,v*2);
else update(pos,val,k,mid+1,r,v*2+1);
segtree[v][k]=comb(segtree[v*2][k],segtree[v*2+1][k]);
}
pair<ll,ll> query(ll tl,ll tr,ll k,ll l=1,ll r=MX,ll v=1){
if(tl>tr){
return {0,1};
}
else if(tl<=l and r<=tr){
return segtree[v][k];
}
ll mid=(l+r)/2;
return comb(query(tl,min(mid,tr),k,l,mid,v*2),query(max(tl,mid+1),tr,k,mid+1,r,v*2+1));
}
int main() {_
//setIO("wayne");
ll n;
cin>>n;
for(ll i=1;i<=n;i++){
cin>>arr[i];
num[arr[i]]++;
}
for(auto &v:num){
MX++;
v.s=MX;
}
for(ll i=1;i<=n;i++){
id[i]=num[arr[i]];
}
for(ll i=n;i>=1;i--){
pair<ll,ll> tmp=query(id[i]+1,MX,0);
update(id[i],{tmp.f+1,tmp.s},0);
}
for(ll i=n;i>=1;i--){
pair<ll,ll> tmp=query(1,id[i]-1,1);
update(id[i],{tmp.f+1,tmp.s},1);
}
pair<ll,ll> best={0,0};
for(ll i=1;i<=n;i++){
best=comb(best,{(query(id[i],id[i],1).f+query(id[i]+1,MX,0).f)%mod,(query(id[i],id[i],1).s*query(id[i]+1,MX,0).s)%mod});
//cout<<best.f<<' '<<best.s<<'\n';
}
cout<<best.f<<' '<<best.s*fpow(2,n-best.f)/2;
return 0;
}
//maybe its multiset not set
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |