Submission #13891

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
13891	2015-04-11 00:58:35	comet	역사적 조사 (JOI14_historical)	C++98	15 / 100	243 ms	120156 KiB

historic

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll long long
int N,Q,x[100010],c[100010][300],p[100010],s[100010],sz;
ll d[300][300];
int main(){
  scanf("%d%d",&N,&Q);
  for(int i=0;i<N;i++)scanf("%d",&x[i]),s[sz++]=x[i];
  sort(s,s+sz);
  sz=unique(s,s+sz)-s;
  for(int i=0;i<N;i++)x[i]=lower_bound(s,s+sz,x[i])-s;
  for(int i=0;i<N;i++){
    if(!(i&255)){
      for(int j=0;j<sz;j++)c[j][(i>>8)+1]=c[j][i>>8];
      for(int j=0;j<=(i>>8);j++)d[j][(i>>8)+1]=d[j][i>>8];
    }
    p[x[i]]++;
    c[x[i]][(i>>8)+1]++;
    for(int j=0;j<=(i>>8);j++)d[j][(i>>8)+1]=max(d[j][(i>>8)+1],1ll*s[x[i]]*(c[x[i]][(i>>8)+1]-c[x[i]][j]));
  }
  memset(p,0,sizeof(p));
  int S,E,l,r;
  ll ans;
  while(Q--){
    scanf("%d%d",&S,&E);
    S--;
    l=(S+255)>>8;
    r=E>>8;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 25
• Subtask 4: 0 / 60