Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <vector> #include <queue> using namespace std; typedef long long ll; int main() { int n; cin >> n; vector<int> v(n); for(int i = 0; i < n; i++) { cin >> v[i]; } vector<int> dp(n, 2e9); dp[0] = 0; for(int i = 0; i < n; i++) { if(i + 1 < n) { dp[i + 1] = min(dp[i + 1], dp[i] + abs(v[i] - v[i + 1])); } if(i + 2 < n) { dp[i + 2] = min(dp[i + 2], dp[i] + abs(v[i] - v[i + 2])); } } cout << dp[n - 1] << endl; return 0; } // frog(0) --> (frog(1), frog(2)) // frog(1) --> frog(2), frog(3)
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
