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>
#define TASKNAME "bieudo"
#define pb push_back
#define pli pair<int,int>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=1e6+10;
const ll inf=1e18;
const ll mod=1e9+7;
ll bit[maxN];
ll a[maxN];
vector<ll> vec[maxN];
ll n;
void update(ll i,ll val)
{
while(i<=1e6)
{
bit[i]+=val;
i+=(i&(-i));
}
}
ll get(ll i)
{
ll cc=0;
while(i>0)
{
cc+=bit[i];
i-=(i&(-i));
}
return cc;
}
ll getlr(ll i,ll j)
{
if(i>j) return 0;
return get(j)-get(i-1);
}
void solve()
{
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> a[i];
//cout << a[i]<<' ';
}
a[0]=0;
ll cnt=0;
for(int i=1;i<=n;i++)
{
ll j=i+1;
cnt++;
vec[cnt].pb(a[i]);
while(j<=n&&a[j]>=a[j-1])
{
vec[cnt].pb(a[j]);
j++;
}
i=j-1;
}
for(auto zz:vec[1])
{
update(zz,1);
}
ll ans=cnt;
for(int i=2;i<=cnt;i++)
{
for(int j=1;j<vec[i].size();j++)
{
if(getlr(vec[i][j-1],vec[i][j]-1)>0)
{
ans++;
}
}
for(auto zz:vec[i])
{
update(zz,1);
}
}
cout << ans;
}
int main()
{
fastio
//freopen(TASKNAME".INP","r",stdin);
//freopen(TASKNAME".OUT","w",stdout);
solve();
}
Compilation message (stderr)
money.cpp: In function 'void solve()':
money.cpp:67:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | for(int j=1;j<vec[i].size();j++)
| ~^~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |