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 nMax = 505; typedef long long ll; ll best[nMax][nMax], dim[nMax]; int main() { int n; cin >> n; for(int i=0; i<=n; i++) cin >> dim[i]; for(int i=1; i<n; i++) best[i][i+1] = dim[i-1] * dim[i] * dim[i+1]; for(int d=2; d<=n-1; d++) { for(int i=1; i<=n-d; i++) { best[i][i + d] = LONG_LONG_MAX; for(int k=i; k< i+ d; k++) { best[i][i + d] = min(best[i][i + d], best[i][k] + best[k +1][i + d] + dim[i-1] * dim[k] * dim[i + d]); } } } cout << best[1][n]; }
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)
