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_29899399_25343.cpp:10:2: error: stray '#' in program
     tree[rt]=tree[rt<<1]+tree[rt<<1|1];//向上维护树内数据
  ^
0_0_29899399_25343.cpp:10:8: error: stray '#' in program
     tree[rt]=tree[rt<<1]+tree[rt<<1|1];//向上维护树内数据
        ^
0_0_29899399_25343.cpp:10:14: error: stray '#' in program
     tree[rt]=tree[rt<<1]+tree[rt<<1|1];//向上维护树内数据
              ^
0_0_29899399_25343.cpp:14:2: error: stray '#' in program
     if(flag[rt])//被懒惰标记上的节点要给他们的子节点覆盖上值 同时也要给他们的子节点懒惰标记上~
  ^
0_0_29899399_25343.cpp:14:8: error: stray '#' in program
     if(flag[rt])//被懒惰标记上的节点要给他们的子节点覆盖上值 同时也要给他们的子节点懒惰标记上~
        ^
0_0_29899399_25343.cpp:14:14: error: stray '#' in program
     if(flag[rt])//被懒惰标记上的节点要给他们的子节点覆盖上值 同时也要给他们的子节点懒惰标记上~
              ^
0_0_29899399_25343.cpp:15:2: error: stray '#' in program
     {
  ^
0_0_29899399_25343.cpp:15:8: error: stray '#' in program
     {
        ^
0_0_29899399_25343.cpp:15:14: error: stray '#' in program
     {
              ^
0_0_29899399_25343.cpp:16:2: error: stray '#' in program
         int m=(l+r)/2;
  ^
0_0_29899399_25343.cpp:16:8: error: stray '#' in program
         int m=(l+r)/2;
        ^
0_0_29899399_25343.cpp:16:14: error: stray '#' in program
         int m=(l+r)/2;
              ^
0_0_29899399_25343.cpp:16:20: error: stray '#' in program
         int m=(l+r)/2;
                    ^
0_0_29899399_25343.cpp:16:26: error: stray '#' in program
         int m=(l+r)/2;
                          ^
0_0_29899399_25343.cpp:16:32: error: stray '#' in program
         int m=(l+r)/2;
                                ^
0_0_29899399_25343.cpp:16:38: error: stray '#' in program
         int m=(l+r)/2;
                                      ^
0_0_29899399_25343.cpp:17:2: error: stray '#' in program
         flag[rt*2]=flag[rt*2+1]=flag[rt];
  ^
0_0_29899399_25343.cpp:17:8: error: stray '#' in program
         flag[rt*2]=flag[rt*2+1]=flag[rt];
        ^
0_0_29899399_25343.cpp:17:14: error: stray '#' in program
         flag[rt*2]=flag[rt*2+1]=flag[rt];
              ^
0_0_29899399_25343.cpp:17:20: error: stray '#' in program
         flag[rt*2]=flag[rt*2+1]=flag[rt];
                    ^
0_0_29899399_25343.cpp:17:26: error: stray '#' in program
         flag[rt*2]=flag[rt*2+1]=flag[rt];
                          ^
0_0_29899399_25343.cpp:17:32: error: stray '#' in program
         flag[rt*2]=flag[rt*2+1]=flag[rt];
                                ^
0_0_29899399_25343.cpp:17:38: error: stray '#' in program
         flag[rt*2]=flag[rt*2+1]=flag[rt];
                                      ^
0_0_29899399_25343.cpp:18:2: error: stray '#' in program
         tree[rt*2]=(m-l+1)*flag[rt];//这里是覆盖一段值(区间覆盖值)所以要考虑区间长度的问题 这里希望读者细细品味.
  ^
0_0_29899399_25343.cpp:18:8: error: stray '#' in program
         tree[rt*2]=(m-l+1)*flag[rt];//这里是覆盖一段值(区间覆盖值)所以要考虑区间长度的问题 这里希望读者细细品味.
        ^
0_0_29899399_25343.cpp:18:14: error: stray '#' in program
         tree[rt*2]=(m-l+1)*flag[rt];//这里是覆盖一段值(区间覆盖值)所以要考虑区间长度的问题 这里希望读者细细品味.
              ^
0_0_29899399_25343.cpp:18:20: error: stray '#' in program
         tree[rt*2]=(m-l+1)*flag[rt];//这里是覆盖一段值(区间覆盖值)所以要考虑区间长度的问题 这里希望读者细细品味.
                    ^
0_0_29899399_25343.cpp:18:26: error: stray '#' in program
         tree[rt*2]=(m-l+1)*flag[rt];//这里是覆盖一段值(区间覆盖值)所以要考虑区间长度的问题 这里希望读者细细品味.
                          ^
0_0_29899399_25343.cpp:18:32: error: stray '#' in program
         tree[rt*2]=(m-l+1)*flag[rt];//这里是覆盖一段值(区间覆盖值)所以要考虑区间长度的问题 这里希望读者细细品味.
                                ^
0_0_29899399_25343.cpp:18:38: error: stray '#' in program
         tree[rt*2]=(m-l+1)*flag[rt];//这里是覆盖一段值(区间覆盖值)所以要考虑区间长度的问题 这里希望读者细细品味.
                                      ^
0_0_29899399_25343.cpp:19:2: error: stray '#' in program
         tree[rt*2+1]=(r-(m+1)+1)*flag[rt];
  ^
0_0_29899399_25343.cpp:19:8: error: stray '#' in program
         tree[rt*2+1]=(r-(m+1)+1)*flag[rt];
        ^
0_0_29899399_25343.cpp:19:14: error: stray '#' in program
         tree[rt*2+1]=(r-(m+1)+1)*flag[rt];
              ^
0_0_29899399_25343.cpp:19:20: error: stray '#' in program
         tree[rt*2+1]=(r-(m+1)+1)*flag[rt];
                    ^
0_0_29899399_25343.cpp:19:26: error: stray '#' in program
         tree[rt*2+1]=(r-(m+1)+1)*flag[rt];
                          ^
0_0_29899399_25343.cpp:19:32: error: stray '#' in program
         tree[rt*2+1]=(r-(m+1)+1)*flag[rt];
                                ^
0_0_29899399_25343.cpp:19:38: error: stray '#' in program
         tree[rt*2+1]=(r-(m+1)+1)*flag[rt];
                                      ^
0_0_29899399_25343.cpp:20:2: error: stray '#' in program
         flag[rt]=0;
  ^
0_0_29899399_25343.cpp:20:8: error: stray '#' in program
         flag[rt]=0;
        ^
0_0_29899399_25343.cpp:20:14: error: stray '#' in program
         flag[rt]=0;
              ^
0_0_29899399_25343.cpp:20:20: error: stray '#' in program
         flag[rt]=0;
                    ^
0_0_29899399_25343.cpp:20:26: error: stray '#' in program
         flag[rt]=0;
                          ^
0_0_29899399_25343.cpp:20:32: error: stray '#' in program
         flag[rt]=0;
                                ^
0_0_29899399_25343.cpp:20:38: error: stray '#' in program
         flag[rt]=0;
                                      ^
0_0_29899399_25343.cpp:21:2: error: stray '#' in program
     }
  ^
0_0_29899399_25343.cpp:21:8: error: stray '#' in program
     }
        ^
0_0_29899399_25343.cpp:21:14: error: stray '#' in program
     }
              ^
0_0_29899399_25343.cpp:25:2: error: stray '#' in program
     if( l == r )//如果递归找到了叶子
  ^
0_0_29899399_25343.cpp:25:8: error: stray '#' in program
     if( l == r )//如果递归找到了叶子
        ^
0_0_29899399_25343.cpp:25:14: error: stray '#' in program
     if( l == r )//如果递归找到了叶子
              ^
0_0_29899399_25343.cpp:26:2: error: stray '#' in program
     {
  ^
0_0_29899399_25343.cpp:26:8: error: stray '#' in program
     {
        ^
0_0_29899399_25343.cpp:26:14: error: stray '#' in program
     {
              ^
0_0_29899399_25343.cpp:27:2: error: stray '#' in program
         tree[rt]=1;//就初始化价值1
  ^
0_0_29899399_25343.cpp:27:8: error: stray '#' in program
         tree[rt]=1;//就初始化价值1
        ^
0_0_29899399_25343.cpp:27:14: error: stray '#' in program
         tree[rt]=1;//就初始化价值1
              ^
0_0_29899399_25343.cpp:27:20: error: stray '#' in program
         tree[rt]=1;//就初始化价值1
                    ^
0_0_29899399_25343.cpp:27:26: error: stray '#' in program
         tree[rt]=1;//就初始化价值1
                          ^
0_0_29899399_25343.cpp:27:32: error: stray '#' in program
         tree[rt]=1;//就初始化价值1
                                ^
0_0_29899399_25343.cpp:27:38: error: stray '#' in program
         tree[rt]=1;//就初始化价值1
                                      ^
0_0_29899399_25343.cpp:28:2: error: stray '#' in program
         flag[rt]=0;//同时初始化清除懒惰标记
  ^
0_0_29899399_25343.cpp:28:8: error: stray '#' in program
         flag[rt]=0;//同时初始化清除懒惰标记
        ^
0_0_29899399_25343.cpp:28:14: error: stray '#' in program
         flag[rt]=0;//同时初始化清除懒惰标记
              ^
0_0_29899399_25343.cpp:28:20: error: stray '#' in program
         flag[rt]=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-27 06:07:07, Gzip enabled