# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710072 | shoryu386 | Money (IZhO17_money) | C++17 | 1 ms | 256 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 int long long
main(){
int n; cin >> n;
int arr[n]; for (int x= 0; x < n;x ++) cin >> arr[x];
vector<vector<int>> subsegs;
set<int> used;
vector<int> curSubseg;
for (int x = 0; x < n; x++){
if (curSubseg.empty() || (curSubseg.back() <= arr[x] && used.lower_bound(curSubseg[0]) == used.upper_bound(arr[x]))) curSubseg.push_back(arr[x]);
else{
for (auto i : curSubseg) used.insert(i);
subsegs.push_back(curSubseg), curSubseg.clear(), x--;
}
}
if (!curSubseg.empty()) subsegs.push_back(curSubseg);
cout << subsegs.size();
}
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... |