error 075: input line too long (after substitutions)

Machs so:

public IsACopCar(carid)
{
if(carid == cop[0] || carid == cop[1] || carid == cop[2] || carid == cop[3] || carid == cop[4] || carid == cop[5] || carid == cop[6] || carid == cop[7]
|| carid == cop[8] || carid == cop[9] || carid == cop[10] || carid == cop[11] || carid == cop[12] || carid == cop[13] || carid == cop[14] || carid == cop[15]
|| carid == cop[16] || carid == cop[17] || carid == cop[18] || carid == cop[19] || carid == cop[20] || carid == cop[21] || carid == cop[22] || carid == cop[23]
|| carid == cop[24] || carid == cop[25])
{
return 1;
}
return 0;
}

Einfacher gehts aber auch so:
public IsACopCar(carid)
{
for(new i = 0; i < sizeof(cop); i ++)
{
if(carid == cop[i]) return 1;
}
return 0;
}
Damit lässt du eine Schleife durchgehen und fragst darin die CarID ab.