# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
385028 | zoooma13 | Money (IZhO17_money) | C++14 | 1 ms | 364 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;
int main()
{
int n;
scanf("%d",&n);
vector <int> a(n);
vector <pair<int ,int>> sa;
for(int&i : a){
scanf("%d",&i);
sa.push_back({i ,sa.size()});
}
sort(sa.begin() ,sa.end());
for(int j=0,i=0; i<n; i++){
j += (i && sa[i].first != sa[i-1].first);
a[sa[i].second] = j;
}
//for(int&i : a) cout << i << ' '; cout << endl;
int ans = 1;
for(int i=1; i<n; i++){
if(a[i] < a[i-1]){
ans++;
continue;
}
bool bad = false;
for(int j=0; j<i; j++)
bad |= (a[i-1] < a[j] && a[j] < a[i]);
ans += bad;
}
printf("%d\n",ans);
}
Compilation message (stderr)
# | 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... |