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 <cstring> #include <cmath> #include <math.h> #include <vector> #include <queue> using namespace std; int n, k; int arr[100005]; int dp[100005]; int frog(int i) { if(i >= n - 1) { return 0; } if(dp[i] != -1) { return dp[i]; } int result = 2e9; for(int j = 1; j <= k; j++) { if(i + j < n) { result = min(result, frog(i + j) + abs(arr[i] - arr[i + j])); } } return dp[i] = result; } int main() { cin >> n >> k; for(int i = 0; i < n; i++) { cin >> arr[i]; } memset(dp, -1, sizeof dp); cout << frog(0) << endl; return 0; }
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)
