F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_33418596_11481.cpp:38:2: error: stray '#' in program
     now = ++tot; tree[now] = tree[old] + 1; lc[now] = lc[old]; rc[now] = rc[old];
  ^
0_0_33418596_11481.cpp:38:8: error: stray '#' in program
     now = ++tot; tree[now] = tree[old] + 1; lc[now] = lc[old]; rc[now] = rc[old];
        ^
0_0_33418596_11481.cpp:38:14: error: stray '#' in program
     now = ++tot; tree[now] = tree[old] + 1; lc[now] = lc[old]; rc[now] = rc[old];
              ^
0_0_33418596_11481.cpp:38:20: error: stray '#' in program
     now = ++tot; tree[now] = tree[old] + 1; lc[now] = lc[old]; rc[now] = rc[old];
                    ^
0_0_33418596_11481.cpp:39:2: error: stray '#' in program
     if(l == r) return;
  ^
0_0_33418596_11481.cpp:39:8: error: stray '#' in program
     if(l == r) return;
        ^
0_0_33418596_11481.cpp:39:14: error: stray '#' in program
     if(l == r) return;
              ^
0_0_33418596_11481.cpp:39:20: error: stray '#' in program
     if(l == r) return;
                    ^
0_0_33418596_11481.cpp:40:2: error: stray '#' in program
     int mid = HalF;
  ^
0_0_33418596_11481.cpp:40:8: error: stray '#' in program
     int mid = HalF;
        ^
0_0_33418596_11481.cpp:40:14: error: stray '#' in program
     int mid = HalF;
              ^
0_0_33418596_11481.cpp:40:20: error: stray '#' in program
     int mid = HalF;
                    ^
0_0_33418596_11481.cpp:41:2: error: stray '#' in program
     if(qx <= mid) Insert(lc[now], lc[old], l, mid, qx);
  ^
0_0_33418596_11481.cpp:41:8: error: stray '#' in program
     if(qx <= mid) Insert(lc[now], lc[old], l, mid, qx);
        ^
0_0_33418596_11481.cpp:41:14: error: stray '#' in program
     if(qx <= mid) Insert(lc[now], lc[old], l, mid, qx);
              ^
0_0_33418596_11481.cpp:41:20: error: stray '#' in program
     if(qx <= mid) Insert(lc[now], lc[old], l, mid, qx);
                    ^
0_0_33418596_11481.cpp:42:2: error: stray '#' in program
     else Insert(rc[now], rc[old], mid + 1, r, qx);
  ^
0_0_33418596_11481.cpp:42:8: error: stray '#' in program
     else Insert(rc[now], rc[old], mid + 1, r, qx);
        ^
0_0_33418596_11481.cpp:42:14: error: stray '#' in program
     else Insert(rc[now], rc[old], mid + 1, r, qx);
              ^
0_0_33418596_11481.cpp:42:20: error: stray '#' in program
     else Insert(rc[now], rc[old], mid + 1, r, qx);
                    ^
0_0_33418596_11481.cpp:46:2: error: stray '#' in program
     if(ql <= l && qr >= r) return tree[tr] - tree[tl];
  ^
0_0_33418596_11481.cpp:46:8: error: stray '#' in program
     if(ql <= l && qr >= r) return tree[tr] - tree[tl];
        ^
0_0_33418596_11481.cpp:46:14: error: stray '#' in program
     if(ql <= l && qr >= r) return tree[tr] - tree[tl];
              ^
0_0_33418596_11481.cpp:46:20: error: stray '#' in program
     if(ql <= l && qr >= r) return tree[tr] - tree[tl];
                    ^
0_0_33418596_11481.cpp:47:2: error: stray '#' in program
     int mid = HalF;
  ^
0_0_33418596_11481.cpp:47:8: error: stray '#' in program
     int mid = HalF;
        ^
0_0_33418596_11481.cpp:47:14: error: stray '#' in program
     int mid = HalF;
              ^
0_0_33418596_11481.cpp:47:20: error: stray '#' in program
     int mid = HalF;
                    ^
0_0_33418596_11481.cpp:48:2: error: stray '#' in program
     if(qr <= mid) return query(lc[tl], lc[tr], l, mid, ql, qr);
  ^
0_0_33418596_11481.cpp:48:8: error: stray '#' in program
     if(qr <= mid) return query(lc[tl], lc[tr], l, mid, ql, qr);
        ^
0_0_33418596_11481.cpp:48:14: error: stray '#' in program
     if(qr <= mid) return query(lc[tl], lc[tr], l, mid, ql, qr);
              ^
0_0_33418596_11481.cpp:48:20: error: stray '#' in program
     if(qr <= mid) return query(lc[tl], lc[tr], l, mid, ql, qr);
                    ^
0_0_33418596_11481.cpp:49:2: error: stray '#' in program
     else if(ql > mid) return query(rc[tl], rc[tr], mid + 1, r, ql, qr);
  ^
0_0_33418596_11481.cpp:49:8: error: stray '#' in program
     else if(ql > mid) return query(rc[tl], rc[tr], mid + 1, r, ql, qr);
        ^
0_0_33418596_11481.cpp:49:14: error: stray '#' in program
     else if(ql > mid) return query(rc[tl], rc[tr], mid + 1, r, ql, qr);
              ^
0_0_33418596_11481.cpp:49:20: error: stray '#' in program
     else if(ql > mid) return query(rc[tl], rc[tr], mid + 1, r, ql, qr);
                    ^
0_0_33418596_11481.cpp:50:2: error: stray '#' in program
     else return query(lc[tl], lc[tr], l, mid, ql, qr) + query(rc[tl], rc[tr], mid + 1, r, ql, qr);
  ^
0_0_33418596_11481.cpp:50:8: error: stray '#' in program
     else return query(lc[tl], lc[tr], l, mid, ql, qr) + query(rc[tl], rc[tr], mid + 1, r, ql, qr);
        ^
0_0_33418596_11481.cpp:50:14: error: stray '#' in program
     else return query(lc[tl], lc[tr], l, mid, ql, qr) + query(rc[tl], rc[tr], mid + 1, r, ql, qr);
              ^
0_0_33418596_11481.cpp:50:20: error: stray '#' in program
     else return query(lc[tl], lc[tr], l, mid, ql, qr) + query(rc[tl], rc[tr], mid + 1, r, ql, qr);
                    ^
0_0_33418596_11481.cpp:54:2: error: stray '#' in program
     scanf("%d", &N);
  ^
0_0_33418596_11481.cpp:54:8: error: stray '#' in program
     scanf("%d", &N);
        ^
0_0_33418596_11481.cpp:54:14: error: stray '#' in program
     scanf("%d", &N);
              ^
0_0_33418596_11481.cpp:54:20: error: stray '#' in program
     scanf("%d", &N);
                    ^
0_0_33418596_11481.cpp:55:2: error: stray '#' in program
     for(int i=1; i<=N; i++) { scanf("%d", &a[i]); pos[a[i]] = i; }
  ^
0_0_33418596_11481.cpp:55:8: error: stray '#' in program
     for(int i=1; i<=N; i++) { scanf("%d", &a[i]); pos[a[i]] = i; }
        ^
0_0_33418596_11481.cpp:55:14: error: stray '#' in program
     for(int i=1; i<=N; i++) { scanf("%d", &a[i]); pos[a[i]] = i; }
              ^
0_0_33418596_11481.cpp:55:20: error: stray '#' in program
     for(int i=1; i<=N; i++) { scanf("%d", &a[i]); pos[a[i]] = i; }
                    ^
0_0_33418596_11481.cpp:56:2: error: stray '#' in program
     for(int i=1; i<=N; i++)
  ^
0_0_33418596_11481.cpp:56:8: error: stray '#' in program
     for(int i=1; i<=N; i++)
        ^
0_0_33418596_11481.cpp:56:14: error: stray '#' in program
     for(int i=1; i<=N; i++)
              ^
0_0_33418596_11481.cpp:56:20: error: stray '#' in program
     for(int i=1; i<=N; i++)
                    ^
0_0_33418596_11481.cpp:57:2: error: stray '#' in program
     {
  ^
0_0_33418596_11481.cpp:57:8: error: stray '#' in program
     {
        ^
0_0_33418596_11481.cpp:57:14: error: stray '#' in program
     {
              ^
0_0_33418596_11481.cpp:57:20: error: stray '#' in program
     {
                    ^
0_0_33418596_11481.cpp:58:2: error: stray '#' in program
         if(a[i] == N) root[i] = root[i - 1];
  ^
0_0_33418596_11481.cpp:58:8: error: stray '#' in program
         if(a[i] == N) root[i] = root[i - 1];
        ^
0_0_33418596_11481.cpp:58:14: error: stray '#' in program
         if(a[i] == N) root[i] = root[i - 1];
              ^
0_0_33418596_11481.cpp:58:20: error: stray '#' in program
         if(a[i] == N) root[i] = root[i - 1];
                    ^
0_0_33418596_11481.cpp:58:26: error: stray '#' in program
         if(a[i] == N) root[i] = root[i - 1];
                          ^
0_0_33418596_11481.cpp:58:32: error: stray '#' in program
         if(a[i] == N) root[i] = root[i - 1];
                                ^
0_0_33418596_11481.cpp:58:38: error: stray '#' in program
         if(a[i] == N) root[i] = root[i - 1];
                                      ^
0_0_33418596_11481.cpp:58:44: error: stray '#' in program
         if(a[i] == N) root[i] = root[i - 1];
                                            ^
0_0_33418596_11481.cpp:59:2: error: stray '#' in program
         else
  ^
0_0_33418596_11481.cpp:59:8: error: stray '#' in program
         else
        ^
0_0_33418596_11481.cpp:59:14: error: stray '#' in program
         else
              ^
0


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-18 07:51:44, Gzip enabled