Submission #1244174
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define pb push_back typedef long long ll; const ll INF = 1000000000000000000ll; const ll MOD = 1000000007ll; const double EPS = 1e-8; int dp[100005]; int main(void) { //ios_base::sync_with_stdio(false); //cin.tie(0); int n; cin >> n; vector<int> a; for(int i=0; i<n; i++){ int t; cin >> t; a.pb(t); } dp[0] = 0; dp[1] = abs(a[1] - a[0]); for(int i=2; i<n; i++){ dp[i] = min(dp[i-1] + abs(a[i] - a[i-1]), dp[i-2] + abs(a[i] - a[i-2])); } cout << dp[n-1] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 柱柱柱柱柱 |
User | tanutarou |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 594 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 1144 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 | 26 ms | 1144 KB |
subtask1_05.txt | AC | 25 ms | 1144 KB |
subtask1_06.txt | AC | 26 ms | 1144 KB |
subtask1_07.txt | AC | 26 ms | 1144 KB |