oj.uz

Submission #11194

# Submission time Handle Problem Language Result Execution time Memory
11194 2014-11-18T14:47:51 Z dohyun0324 역사적 조사 (JOI14_historical) C++
0 / 100
 1516 ms 6672 KB 
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int s2,f,w,r,p,cnt,x,y,n,m,k,pos[100010],arr[100010],ch[100010],big;
long long dap;
struct data{
    int x,y;
    bool operator<(const data&r)const{
        if(x==r.x) return y<r.y;
        return x<r.x;
    }
}imsi[100010];
int b[400][400];
vector<int>a[100010];
int main()
{
    int i,j,s;
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;i++){scanf("%d",&arr[i]); imsi[i].x=arr[i]; imsi[i].y=i;}
    sort(imsi+1,imsi+n+1);
    for(i=1;i<=n;i++)
    {
        if(imsi[i].x!=imsi[i-1].x) cnt++;
        pos[cnt]=imsi[i].x; arr[imsi[i].y]=cnt; a[cnt].push_back(imsi[i].y);
    }
    k=sqrt(n);
    for(i=1;;i++){
        w=i-1; big=0; memset(ch,0,sizeof ch);
        if(k*(i-1)+1>n) break;
        for(j=k*(i-1)+1;j<=n;j++){
            ch[arr[j]]++;
            big=max(big,ch[arr[j]]*pos[arr[j]]);
            if(j%k==0){w++; b[i][w]=big;}
        }
        if(n%k!=0){w++; b[i][w]=big;}
    }
    p=i;
    for(i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        f=(x-1)/k+2; r=(y-1)/k;
        dap=b[f][r];
        if(f>r)
        {
            for(j=x;j<=y;j++)
            {
                s=upper_bound(a[arr[j]].begin(),a[arr[j]].end(),y)-lower_bound(a[arr[j]].begin(),a[arr[j]].end(),x);
                dap=max(dap,(long long)s*(long long)pos[arr[j]]);
            }
            printf("%lld\n",dap);
            continue;
        }
        for(j=x;j<=(f-1)*k;j++)
        {
            if(j>y) break;
            s=upper_bound(a[arr[j]].begin(),a[arr[j]].end(),y)-lower_bound(a[arr[j]].begin(),a[arr[j]].end(),x);
            dap=max(dap,(long long)s*(long long)pos[arr[j]]);
        }
        for(j=r*k+1;j<=y;j++)
        {
            s=upper_bound(a[arr[j]].begin(),a[arr[j]].end(),y)-lower_bound(a[arr[j]].begin(),a[arr[j]].end(),x);
            dap=max(dap,(long long)s*(long long)pos[arr[j]]);
        }
        printf("%lld\n",dap);
    }
    return 0;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6144 KB Output is correct
2 Correct 0 ms 6144 KB Output is correct
3 Correct 0 ms 6144 KB Output is correct
4 Correct 0 ms 6144 KB Output is correct
5 Correct 0 ms 6144 KB Output is correct
6 Correct 0 ms 6144 KB Output is correct
7 Incorrect 0 ms 6144 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6144 KB Output is correct
2 Correct 4 ms 6144 KB Output is correct
3 Correct 4 ms 6144 KB Output is correct
4 Incorrect 4 ms 6144 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6144 KB Output is correct
2 Correct 0 ms 6144 KB Output is correct
3 Correct 0 ms 6144 KB Output is correct
4 Correct 0 ms 6144 KB Output is correct
5 Correct 0 ms 6144 KB Output is correct
6 Correct 8 ms 6144 KB Output is correct
7 Correct 8 ms 6144 KB Output is correct
8 Incorrect 8 ms 6144 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 6144 KB Output is correct
2 Correct 344 ms 6144 KB Output is correct
3 Correct 456 ms 6276 KB Output is correct
4 Correct 596 ms 6540 KB Output is correct
5 Correct 852 ms 6672 KB Output is correct
6 Incorrect 1516 ms 6540 KB Output isn't correct
7 Halted 0 ms 0 KB -