# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36589 | IvanC | 역사적 조사 (JOI14_historical) | C++14 | 1879 ms | 133784 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>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
const int BUCKET = 327;
vector<int> ida,volta;
int freq[BUCKET][MAXN],tempfreq[MAXN],versao[MAXN],divisao[MAXN],vetor[MAXN],iteracao,N,Q;
ll precalc[BUCKET][BUCKET];
void build(int id){
for(int i = 0;i<min((id+1)*BUCKET,N);i++){
int j = vetor[i];
freq[id][j]++;
}
memset(tempfreq,0,sizeof(tempfreq));
ll best = 0;
for(int i = id*BUCKET;i<N;i++){
int j = vetor[i];
tempfreq[j]++;
best = max(best, 1LL*tempfreq[j]*volta[j] );
precalc[id][divisao[i]] = best;
}
}
int main(){
scanf("%d %d",&N,&Q);
for(int i = 0;i<N;i++){
scanf("%d",&vetor[i]);
divisao[i] = i/BUCKET;
ida.push_back(vetor[i]);
}
sort(ida.begin(),ida.end());
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... |