# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415242 | keta_tsimakuridze | Group Photo (JOI21_ho_t3) | C++14 | 842 ms | 509324 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define f first
#define int long long
#define s second
using namespace std;
const int N=5005,mod=1e9+7,Inf=1e9;
int t,ind[N],dp[N],inv[N][N],p[N][N],n,a[N],I[N][N];
string s;
main(){
// t=1;
cin >> n;
for(int i=1;i<=n;i++){
cin>>a[i];
ind[a[i]] = i;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++) {
inv[i][j] = inv[i][j-1] + (ind[j]>ind[i]);
p[i][j] = p[i-1][j] + inv[i][j];
}
}
for(int i=1;i<=n;i++) {
dp[i] = Inf;
for(int j=i;j<=n;j++){
I[i][j] = I[i][j-1] + (j-i) - (inv[j][j] - inv[j][i-1]);
}
}
for(int i=1;i<=n;i++) {
for(int j=i;j<=n;j++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |