刚学的数据结构，顺序表，求帮我看看出什么问题了

课本上的算法改的，老师也是这么打为什么我错了
#include<iostream>
using namespace std;
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define MAXSIZE 100
typedef int ElemType;
typedef int status;
typedef struct
{
ElemType *elem;
int length;
}SqList;
Status InitList(SqList &L)
{
L.elem=new ElemType[MAXSIZE];
if(!L.elem)
exit(OVERFLOW);
L.length=0;
return OK;
}
Status GetElem(SqList L,int i,ElemType &e)
{
if (i<1||i>L.length)
return ERROR;
e=L.elem[i-1];
return OK;
}
int LocateElem(SqList L,ElemType e)
{
for(i=0;i<L.length;i++)
if(L.elem[i]==e)
return i+1;
return 0;
}
Status ListInsert(SqList &L,int i,ElemType e)
{
if(((i<1)||(i<L.length+1))
return ERROR;
for(j=L.length-1;j>=i-1;j--)
L.elem[j+1]=l.elem[j];
L.elem[i-1]=e;
++L.length;
return OK;
}
Status ListDelete(SqList &L,int i)
{
if((i<1)||(i>L.length))
return ERROR;
for(j=i;j=L.length-1;j++)
L.elem[j-1]=L.elem[j];
--l.length;
return OK;
}
void main()
{}