Submission #1245041
Source Code Expand
#include<iostream> #include<string> using namespace std; #define loop(i,a,b) for(int i=a;i<b;i++) #define rep(i,n) for(int i=0;i<n;i++) #include<vector> #include<algorithm> int main(){ int n; cin>>n; vector<long long>in(n),dp(n); rep(i,n)cin>>in[i]; dp[1]=abs(in[0]-in[1]); loop(i,2,n){ dp[i]=min(dp[i-2]+abs(in[i]-in[i-2]), dp[i-1]+abs(in[i]-in[i-1])); } cout<<dp[n-1]<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 柱柱柱柱柱 |
User | yebityon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 425 Byte |
Status | AC |
Exec Time | 26 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 | 25 ms | 1792 KB |
subtask1_05.txt | AC | 26 ms | 1792 KB |
subtask1_06.txt | AC | 25 ms | 1792 KB |
subtask1_07.txt | AC | 25 ms | 1792 KB |