| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1182160 | mecukuryurt | Mountains (NOI20_mountains) | C++20 | 2096 ms | 2628 KiB |
#include <iostream>
#define lli long long int
using namespace std;
lli dp(lli *arr, int n, int sel, lli lst) {
// cout << arr << "-" << n << "-" << sel << "-" << lst << endl;
if (sel <= 0) return 1;
lli sum=0;
if ((sel == 1) || (sel==3)) {
for (int i=0; i<n; i++) {
if (lst > arr[i]) sum+=dp(arr+i+1, n-i-1, sel-1, arr[i]);
}
}
if (sel == 2) {
for (int i=0; i<n; i++) {
if (lst < arr[i]) sum+=dp(arr+i+1, n-i-1, sel-1, arr[i]);
}
}
return sum;
}
int main()
{
int n;
cin >> n;
lli arr[n];
for (int i=0; i<n;i++) {
cin >> arr[i];
}
cout << dp(arr, n, 3, 1000000000000000000);
return 0;
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
