OJ平台提交以下代码，提示运行错误

在学校的OJ平台提交以下代码，提示运行错误，具体为：Segmentation fault:段错误，检查是否有数组越界，指针异常，访问到不应该访问的内存区域。想问下是哪里的问题，代码在其他dev C++和lightly上运行没有问题。

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 20
#define OK 1
#define ERROR 0

typedef int Status;
typedef int SqElemType;

typedef struct {
    SqElemType *top;
    SqElemType *base;
    int StackSize;
} SqStack;


Status InitStack(SqStack *S) {
    S->base = (SqElemType *)malloc(sizeof(SqElemType) * STACK_INIT_SIZE);
    if (!S->base)
        return ERROR;
    S->top = S->base;
    S->StackSize = STACK_INIT_SIZE;
    return OK;
}

Status Push(SqStack *S, SqElemType e) {
    if (S->top - S->base >= S->StackSize) {
        S->base = (SqElemType *)realloc(S->base, sizeof(SqElemType) * STACKINCREMENT);
        if (!S->base)
            return ERROR;
        S->top = S->base + S->StackSize;
        S->StackSize += STACKINCREMENT;
    }
    *S->top = e;
    S->top++;
    return OK;
}

Status Pop(SqStack *S, SqElemType *e) {
    if (S->top == S->base)
        return ERROR;
    S->top--;
    *e = *S->top;
    return OK;
}


int main() {
    char str[100001], num[100001] = {0};
    int cnt = 0, length = 0;
    SqStack S;
    InitStack(&S);
    while (scanf("%s", str) != EOF) {
        length = strlen(str);
        for (int i = 0; i < length; i++) {
            if (str[i] == '(') {
                Push(&S, i + 1);            //左括号下标入栈
            } else {
                Pop(&S, &cnt);            //cnt为左括号下标
                num[cnt] = i + 1;            //num数组第cnt位存对应右括号下标
            }
        }
        for (int i = 0; i < length; i++) {
            if (num[i] != 0)
                printf("%d %d\n", i, num[i]);
            num[i] = 0;                    //输出完归零
        }
    }
    return 0;
}

有可能是数组开得不够大，请仔细检查一下数据范围

修改如下，改动处见注释，供参考:

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 20
#define OK 1
#define ERROR 0

typedef int Status;
typedef int SqElemType;

typedef struct {
    SqElemType* top;
    SqElemType* base;
    int StackSize;
} SqStack;

Status InitStack(SqStack* S) {
    S->base = (SqElemType*)malloc(sizeof(SqElemType) * STACK_INIT_SIZE);
    if (!S->base)
        return ERROR;
    S->top = S->base;
    S->StackSize = STACK_INIT_SIZE;
    return OK;
}

Status Push(SqStack* S, SqElemType e) {
    if (S->top - S->base >= S->StackSize) {
        SqElemType* newbase = (SqElemType*)realloc(S->base, sizeof(SqElemType) * (STACK_INIT_SIZE + STACKINCREMENT)); // 修改
        //S->base = (SqElemType*)realloc(S->base, sizeof(SqElemType) * STACKINCREMENT);
        if (!newbase)  //if (!S->base)  // 修改
            return ERROR;
        S->base = newbase;  // 修改
        S->top = S->base + S->StackSize;
        S->StackSize += STACKINCREMENT;    
    }
    *S->top = e;
    S->top++;
    return OK;
}

Status Pop(SqStack* S, SqElemType* e) {
    if (S->top == S->base)
        return ERROR;
    S->top--;
    *e = *S->top;
    return OK;
}


int main() {
    char str[100001], num[100001] = { 0 };
    int cnt = 0, length = 0;
    SqStack S;
    InitStack(&S);
    while (scanf("%s", str) != EOF) {
        length = strlen(str);
        for (int i = 0; i < length; i++) {
            if (str[i] == '(') {
                Push(&S, i + 1);   //左括号下标入栈
            }
            else if (str[i] == ')') {  // 修改
                if (Pop(&S, &cnt))     // 修改
                    num[cnt] = i + 1;  //cnt为左括号下标,num数组第cnt位存对应右括号下标
            }
        }
        for (int i = 0; i < length; i++) {
            if (num[i] != 0)
                printf("%d %d\n", i, num[i]);
            num[i] = 0;            //输出完归零
        }
    }
    return 0;
}

不知道你这个问题是否已经解决, 如果还没有解决的话:

• 这个问题的回答你可以参考下: https://ask.csdn.net/questions/7584970
• 除此之外, 这篇博客: segmentation fault 错误（运行一个简单的helloworld程序）中的 一、出错如下 部分也许能够解决你的问题, 你可以仔细阅读以下内容或者直接跳转源博客中阅读:
  

  程序100%正确。。。尴尬。

  #include <stdio.h>
  
  void main()
  {
    printf("Hello World\n");
  }
  

  在linux主机上编译，下载到开发板后运行结果如下：
  

如果你已经解决了该问题, 非常希望你能够分享一下解决方案, 写成博客, 将相关链接放在评论区, 以帮助更多的人 ^-^