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 <bits/stdc++.h> using namespace std; const int INF = 2e9; int main() { int n; cin >> n; vector<int> v(n); vector<int> dp1(n + 1), dp2(n + 1), dp3(n + 1), dp4(n + 1); for(int i = 0; i < n; i++) { cin >> v[i]; } for(int i = 0; i < n; i++) { dp1[i] = -INF; dp2[i] = -INF; dp3[i] = -INF; dp4[i] = -INF; } for(int i = n - 1; i >= 0; i--) { dp1[i] = max(dp1[i + 1], v[i]); } for(int i = n - 2; i >= 0; i--) { dp2[i] = max(dp2[i + 1], dp1[i + 1] - v[i]); } for(int i = n - 3; i >= 0; i--) { dp3[i] = max(dp3[i + 1], dp2[i + 1] + v[i]); } for(int i = n - 4; i >= 0; i--) { dp4[i] = max(dp4[i + 1], dp3[i + 1] - v[i]); } int res = -INF; for(int i = 0; i <= n; i++) { res = max(res, dp4[i]); } cout << res << 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)
