# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710062 | 2023-03-15T04:14:21 Z | shoryu386 | Money (IZhO17_money) | C++17 | 1 ms | 212 KB |
#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; vector<int> curSubseg; for (int x = 0; x < n; x++){ if (curSubseg.empty() || curSubseg.back() <= arr[x]) curSubseg.push_back(arr[x]); else subsegs.push_back(curSubseg), curSubseg.clear(), x--; } if (!curSubseg.empty()) subsegs.push_back(curSubseg); cout << subsegs.size(); /* cout << '\n'; for (auto x : subsegs){ for (auto y : x){ cout << y << ' '; } cout << '\n'; } * */ }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |