Submission #1322248
Source Code Expand
#include <iostream> #include <cstdio> #include <cmath> #include <cstring> #include <string> #include <stack> #include <queue> #include <algorithm> #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) using namespace std; long long n, a[100004]; long long dp[200000]; int DP(int num, int cost) { if (dp[num] != -1) { // cout << num << endl; return dp[num]; } if (num > n-1) { return 10000000; } if (num == n-1) { return cost; } //cout << cost<<"a"; return dp[num] = min(DP(num + 1, cost + abs(a[num] - a[num + 1])), DP(num + 2, cost + abs(a[num] - a[num + 2]))); } int main() { memset(a, 0, sizeof(a)); memset(dp, -1, sizeof(dp)); cin >> n; REP(i, n) { cin >> a[i]; } cout << DP(0, 0) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 柱柱柱柱柱 |
User | keidaroo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 789 Byte |
Status | WA |
Exec Time | 29 ms |
Memory | 4992 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 2 ms | 2560 KB |
sample_02.txt | AC | 2 ms | 2560 KB |
sample_03.txt | WA | 2 ms | 2560 KB |
subtask1_01.txt | AC | 2 ms | 2560 KB |
subtask1_02.txt | AC | 2 ms | 2560 KB |
subtask1_03.txt | AC | 2 ms | 2560 KB |
subtask1_04.txt | WA | 28 ms | 4864 KB |
subtask1_05.txt | WA | 28 ms | 4992 KB |
subtask1_06.txt | WA | 29 ms | 4864 KB |
subtask1_07.txt | WA | 28 ms | 4992 KB |