Submission #1308298
Source Code Expand
#include <iostream> #include <vector> using namespace std; int main() { ios::sync_with_stdio(false); int N; cin >> N; vector<long long> As(N, 0); for (auto & a : As) cin >> a; vector<long long> cost(N, 0); cost[1] = abs(As[1] - As[0]); for (int i = 2; i != N; ++i){ cost[i] = min(cost[i - 1] + abs(As[i - 1] - As[i]), cost[i - 2] + abs(As[i - 2] - As[i])); } cout << cost[N - 1] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 柱柱柱柱柱 |
User | rpy3cpp |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 469 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 10 ms | 1792 KB |
subtask1_05.txt | AC | 9 ms | 1792 KB |
subtask1_06.txt | AC | 10 ms | 1792 KB |
subtask1_07.txt | AC | 10 ms | 1792 KB |