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 <vector> #include <set> #include <algorithm> using namespace std; typedef long long ll; int main() { int n; ll M; cin >> n >> M; ll P[n]; for(int i = 0; i < n; i++) { cin >> P[i]; } sort(P, P + n); ll result = -5e18; do{ ll ans = 0; if(P[0] == 0) { for(int i = 0; i < n - 1; i++) { ans += llabs(P[i] - P[i + 1]); } ans += llabs(P[n - 1] - P[0]); if(ans <= M) { result = max(result, ans); } } }while(next_permutation(P, P + n)); cout << result << 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)
