-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAnotherPermutationProblem.cpp
More file actions
46 lines (43 loc) · 1.08 KB
/
Copy pathAnotherPermutationProblem.cpp
File metadata and controls
46 lines (43 loc) · 1.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
// Codeforces Problem: C - Another Permutation Problem
// Link: https://codeforces.com/contest/1859/problem/C
// Status: Accepted Language: C++
#include<iostream>
// #include<bits/stdc++.h>
// #include<set>
// #include<vector>
// #include<map>
#include<algorithm>
using namespace std;
#define ll long long
#define nl "\n"
#define ws " "
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define MOD 1000000007
int main () {
FASTIO
int t;
cin>>t;
while (t--) {
int n;
cin>>n;
int arr[n];
for (int i = 0; i < n; i++) {
arr[i] = i + 1;
}
int ans = 0;
for (int i = 0; i < n - 1; i++) {
int cur = 0, arr2[n], mx = 0;
for (int j = 0; j < n; j++) {
arr2[j] = arr[j];
}
reverse (arr2 + i, arr2 + n);
for (int j = 0; j < n; j++) {
cur += arr2[j] * (j + 1);
mx = max (mx, arr2[j] * (j + 1));
}
ans = max (ans, cur - mx);
}
cout<<ans<<nl;
}
return 0;
}