# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72417 | 인프라웨어 상한가 가주세요. 물렸어요 (#118) | Box Run (FXCUP3_box) | C++17 | 1085 ms | 736 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 <vector>
#include <iostream>
using namespace std;
int main() {
int N; cin >> N;
vector<long long> arr(N + 1);
for (int i = 1; i <= N; ++i) cin >> arr[i];
vector<int> sol;
for (int i = 1; i <= N; ++i) { // �ʺ�
int lessCnt = 0;
int here = arr[1]; // �������
bool hasSol = false;
for (int j = i + 1; j <= N; ++j) {
int lessCnt = 0;
for (int k = j - 1; k >= j - i; --k) {
if (arr[j] > arr[k])
lessCnt++;
}
if (lessCnt == i) {
int sub = i - 1;
sol.push_back(j - 1 - sub);
hasSol = true;
break;
}
}
if (hasSol == false)
sol.push_back(-1);
}
for (int i = 0; i < sol.size(); ++i)
cout << sol[i] << " ";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |