제출 #6113

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
6113	2014-06-19 20:56:54	kriii	즐거운 채소 기르기 (JOI14_growing)	C++98	100 / 100	316 ms	19888 KiB

growing

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 <stdio.h>
#include <map>
using namespace std;
int N,D[300030],L[300030],R[300030],B[300030],C;
map<int, int> chk;
int main()
{
  scanf ("%d",&N);
  for (int i=0;i<N;i++) scanf ("%d",&D[i]), chk[D[i]] = 0;
  for (map<int,int>::iterator I = chk.begin(); I != chk.end(); I++) I->second = ++C;
  for (int i=0;i<N;i++) D[i] = chk[D[i]];
  for (int i=0;i<N;i++){
    L[i] = i;
    for (int x=D[i];x;x-=x&(-x)) L[i] -= B[x];
    for (int x=D[i];x<=C;x+=x&(-x)) B[x]++;
  }
  for (int i=1;i<=C;i++) B[i] = 0;
  for (int i=N-1;i>=0;i--){
    R[i] = N-1-i;
    for (int x=D[i];x;x-=x&(-x)) R[i] -= B[x];
    for (int x=D[i];x<=C;x+=x&(-x)) B[x]++;
  }
  long long ans = 0;
  for (int i=0;i<N;i++) ans += L[i] < R[i] ? L[i] : R[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 15 / 15
• Subtask 4: 55 / 55