Needed to make a tight O analysis of the algorithm please help me with this :     

Make a tight big-O analysis of following code. I'm getting confused due to this array please help. 

 

    void main( )
        {
        int m,n,i,j,a[ ], b[ ], c[ ]; printf(''Enter value of m and n''); scanf(''%d %d'',&m, &n);
        for (i = 0; I < n; i++)
        {
        a[i] = i;
        b[i] = i*i;
        c[i]= -i;
        }
        for (j = 0; j < m; j++)
        {
        printf(''%d\t %d\t %d\n'', a(j), b(j), c(j);
        }
        }

