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
#include
using namespace std; vector
v; int m; int n; int dp[1010][55]; int rec(int scena_i, int pos_i ){ if((scena_i<0)or(scena_i>m)){ return -1; } if(pos_i==n){ return(scena_i); } if(dp[scena_i][pos_i]!=-1){ return(dp[scena_i][pos_i]); } int result=-1; result=max(result, rec(scena_i-v[pos_i], pos_i+1)); result=max(result, rec(scena_i+v[pos_i], pos_i+1)); dp[scena_i][pos_i]=result; return(result); } int main() { int p; cin>>p>>m; cin>>n; for(int i=0; i
>a; v.push_back(a); } for(int i=0; i<1010; i++){ for(int j=0; j
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)