| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 5910 | cki86201 | 역사적 조사 (JOI14_historical) | C++98 | 0 ms | 0 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<stdio.h>
#include<math.h>
#include<algorithm>
#include<unordered_map>
#include<set>
using namespace std;
typedef long long ll;
int n, k, qu;
ll ans[100010];
int p[100010];
unordered_map <int,int> M;
multiset <ll> S;
struct qua{
qua(){}
qua(int s,int d):s(s),d(d){}
int s, d, c;
bool operator<(const qua &l)const{
return d/k != l.d/k ? d/k < l.d/k : (((d/k)&1) ? s < l.s : s > l.s);
}
}q[100010];
int main()
{
scanf("%d%d",&n,&qu);
k = int(sqrt(n));
int i;
for(i=1;i<=n;i++)scanf("%d",p+i);
for(i=0;i<qu;i++)scanf("%d%d",&q[i].s,&q[i].d), q[i].c = i;
sort(q,q+qu);
int L = 1, R = 0;
for(i=0;i<qu;i++){
while(L>q[i].s)S.insert(++M[p[--L]] * (ll)p[L]);
while(R<q[i].d)S.insert(++M[p[++R]] * (ll)p[R]);
while(L<q[i].s)S.erase(S.find(M[p[L]]-- * (ll)p[L++]));
while(R>q[i].d)S.erase(S.find(M[p[R]]-- * (ll)p[R--]));
ans[q[i].c] = *S.rbegin();
}
for(i=0;i<qu;i++)printf("%lld\n",ans[i]);
return 0;
}