oj.uz

Submission #13740

# Submission time Handle Problem Language Result Execution time Memory
13740 2015-03-30T14:45:13 Z gs13068 역사적 조사 (JOI14_historical) C++
5 / 100
 32 ms 147784 KB 
#include<cstdio>
#include<algorithm>

int a[111111];
int t[111111],tn;
int c[111111][333];
long long d[333][333];
int p[111111];

int main()
{
	long long res;
    int i,j,k,s,e,n,m,l,r;
    scanf("%d%d",&n,&m);
    for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		t[i]=a[i];
	}
	std::sort(t,t+n);
	tn=std::unique(t,t+n)-t;
    for(i=0;i<n;i++)a[i]=std::lower_bound(t,t+tn,a[i])-t;
	for(i=0;i<n;i++)
	{
		if(!(i&511))for(j=0;j<tn;j++)c[j][(i>>9)+1]=c[j][i>>9];
		d[a[i]][(i>>9)+1]++;
	}
	for(i=0;i<(n>>9);i++)
	{
		for(j=i+1;j<=(n>>9);j++)
		{
			d[i][j]=d[i][j-1];
			for(k=(j-1)<<9;k<(j<<9);k++)if(1LL*t[a[k]]*(c[j][a[k]]-c[i][a[k]])>d[i][j])d[i][j]=1LL*t[a[k]]*(c[j][a[k]]-c[i][a[k]]);
		}
	}
	while(m--)
	{
		scanf("%d%d",&s,&e);
        s--;
        l=(s+511)>>9;
        r=e>>9;
        if(l<r)
		{
			res=d[l][r];
			for(i=s;i<(l<<9);i++)p[a[i]]++;
			for(i=r<<9;i<e;i++)p[a[i]]++;
			for(i=s;i<(l<<9);i++)if(1LL*t[a[i]]*(p[a[i]]+c[r][a[i]]-c[l][a[i]])>res)res=1LL*t[a[i]]*(p[a[i]]+c[r][a[i]]-c[l][a[i]]);
			for(i=r<<9;i<e;i++)if(1LL*t[a[i]]*(p[a[i]]+c[r][a[i]]-c[l][a[i]])>res)res=1LL*t[a[i]]*(p[a[i]]+c[r][a[i]]-c[l][a[i]]);
			for(i=s;i<(l<<9);i++)p[a[i]]--;
			for(i=r<<9;i<e;i++)p[a[i]]--;
		}
		else
		{
			res=0;
			for(i=s;i<e;i++)p[a[i]]++;
			for(i=s;i<e;i++)if(1LL*t[a[i]]*p[a[i]]>res)res=1LL*t[a[i]]*p[a[i]];
			for(i=s;i<e;i++)p[a[i]]--;
		}
		printf("%lld\n",res);
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 147784 KB Output is correct
2 Correct 0 ms 147784 KB Output is correct
3 Correct 0 ms 147784 KB Output is correct
4 Correct 0 ms 147784 KB Output is correct
5 Correct 0 ms 147784 KB Output is correct
6 Correct 0 ms 147784 KB Output is correct
7 Correct 0 ms 147784 KB Output is correct
8 Correct 0 ms 147784 KB Output is correct
9 Correct 0 ms 147784 KB Output is correct
10 Correct 0 ms 147784 KB Output is correct
11 Correct 0 ms 147784 KB Output is correct
12 Correct 0 ms 147784 KB Output is correct
13 Correct 0 ms 147784 KB Output is correct
14 Correct 0 ms 147784 KB Output is correct
15 Correct 0 ms 147784 KB Output is correct

Subtask #2
0.0 / 10.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 147784 KB Output isn't correct
2 Halted 0 ms 0 KB -