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 <algorithm> using namespace std; int n; int dp[50]; int niza[50]; int k(int i){ if(i>=n-1){ return 0; } if(dp[i]!=-1){ return dp[i]; } int result=-500; result=max(result,k(i+2)+niza[i]); result=max(result,k(i+1)); return dp[i] = result; } int k2(int i){ if(i<=0){ return 0; } if(dp[i]!=-1){ return dp[i]; } int result=-500; result=max(result,k2(i-2)+niza[i]); result=max(result,k2(i-1)); return dp[i] = result; } int main() { cin>>n; for(int i=0; i<n; i++){ dp[i]=-1; } for(int i=0; i<n; i++){ cin>>niza[i]; } int p=k(0); for(int i=0; i<n; i++){ dp[i]=-1; } int p2=k2(n-1); cout << max(p, p2) << 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)
