北大2777Count Color提交时出现Runtime Error不知道哪里出错了，请高手指点

[xuyapeng1991]

#include<iostream>
using namespace std;
int flag[35];
struct Seg_tree
{
int left,right;
int color;
int num;
int calmid()
{
return (left+right)/2;
}
};
Seg_tree tree[200005];
void build(int left,int right,int idx)
{
tree[idx].left=left;
tree[idx].right=right;
tree[idx].color=1;
tree[idx].num=1;
if(left==right)
return ;
int mid=tree[idx].calmid();
build(left,mid,idx*2);
build(mid+1,right,idx*2+1);
}
void update(int left,int right,int color,int idx)
{
if(tree[idx].left==left&&tree[idx].right==right)
{
tree[idx].color=color;
return ;
}
if(tree[idx].color>=1)
{
tree[idx*2].color=tree[idx].color;
tree[idx*2+1].color=tree[idx].color;
tree[idx].color=-1;
}
int mid=tree[idx].calmid();
if(right<=mid)
update(left,right,color,idx*2);
else if(left>mid)
update(left,right,color,idx*2+1);
else
{
update(left,mid,color,idx*2);
update(mid+1,right,color,idx*2+1);
}
}
void search(int left,int right,int idx)
{
if(tree[idx].color>=1)
{
flag[tree[idx].color]++;
return ;
}
int mid=tree[idx].calmid();
if(right<=mid)
search(left,right,idx*2);
else if(left>mid)
search(left,right,idx*2+1);
else
{
search(left,mid,idx*2);
search(mid+1,right,idx*2+1);
}
}

int main()
{
int M,N,Q;
while(cin>>M>>N>>Q)
{
char ch;
int a,b,c,i;
build(1,M,1);
for(i=0;i<Q;++i)
{
cin>>ch;
if(ch=='C')
{
cin>>a>>b>>c;
update(a,b,c,1);
}
else
{
memset(flag,0,sizeof(flag));
cin>>a>>b;
search(a,b,1);
int ans=0;
for(int j=1;j<=30;++j)
if(flag[j]>0)
ans++;
cout<<ans<<endl;
}
}
}
return 0;
}

[matrixcl]

题目都懒得贴吗？

[aizibion]

内存越界，递归导致堆栈溢出，楼主自己找吧。。。

[jessierzlz]

//表示本程序在vs2010上可以运行
#include<iostream>
#include<cstdlib>
using namespace std;
int flag[35];
struct Seg_tree
{
int left,right;
int color;
int num;
int calmid()
{
return (left+right)/2;
}
};
Seg_tree tree[200005];
void build(int left,int right,int idx)
{
tree[idx].left=left;
tree[idx].right=right;
tree[idx].color=1;
tree[idx].num=1;
if(left==right)
return ;
int mid=tree[idx].calmid();
build(left,mid,idx*2);
build(mid+1,right,idx*2+1);
}
void update(int left,int right,int color,int idx)
{
if(tree[idx].left==left&&tree[idx].right==right)
{
tree[idx].color=color;
return ;
}
if(tree[idx].color>=1)
{
tree[idx*2].color=tree[idx].color;
tree[idx*2+1].color=tree[idx].color;
tree[idx].color=-1;
}
int mid=tree[idx].calmid();
if(right<=mid)
update(left,right,color,idx*2);
else if(left>mid)
update(left,right,color,idx*2+1);
else
{
update(left,mid,color,idx*2);
update(mid+1,right,color,idx*2+1);
}
}
void search(int left,int right,int idx)
{
if(tree[idx].color>=1)
{
flag[tree[idx].color]++;
return ;
}
int mid=tree[idx].calmid();
if(right<=mid)
search(left,right,idx*2);
else if(left>mid)
search(left,right,idx*2+1);
else
{
search(left,mid,idx*2);
search(mid+1,right,idx*2+1);
}
}

int main()
{
int M,N,Q;
while(cin>>M>>N>>Q)
{
char ch;
int a,b,c,i;
build(1,M,1);
for(i=0;i<Q;++i)
{
cin>>ch;
if(ch=='C')
{
cin>>a>>b>>c;
update(a,b,c,1);
}
else
{
memset(flag,0,sizeof(flag));
cin>>a>>b;
search(a,b,1);
int ans=0;
for(int j=1;j<=30;++j)
if(flag[j]>0)
ans++;
cout<<ans<<endl;
}
}
}
system("pause");
return 0;
}

[mskmc_mc]

太长，没看完，看到一个

void build(int left,int right,int idx)
{
tree[idx].left=left;
tree[idx].right=right;
tree[idx].color=1;
tree[idx].num=1;
if(left==right)
return ;

[logiciel]

Seg_tree tree[200005];
不够大,所以出现Runtime Error.试改为以下:
Seg_tree tree[1000000];

[xuyapeng1991]

多谢大家对我的帮助。。