想对洛谷有题的评测提个小建议

#include<cstdio>
#ifndef LUOGU_YOUTI 
#define LUOGU_YOUTI
#define STU_ANS_MAX_SIZE 500020
FILE *ifstuans,*ifstd,*ofstd;
#endif
class stu_ans{
	private:
		char ans[STU_ANS_MAX_SIZE];
		int size,bufpos;
	public:
		stu_ans()
		{
			
		}
		~stu_ans()
		{
			
		}
		stu_ans(FILE* fin)
		{
			ans[size=fread(ans,sizeof(char),STU_ANS_MAX_SIZE,fin)] = '\0';
			bufpos = 0;
		}
		void init(FILE* fin)
		{
			ans[size=fread(ans,sizeof(char),STU_ANS_MAX_SIZE,fin)] = '\0';
			bufpos = 0;
		}
		void ans_print(FILE *fout)
		{
			int i=0,j=1;
			
			for(;ans[i];++j)
			{
				fprintf(fout,"#define ____%d____ ",j);
				for(;ans[i];++i)
				{
					fprintf(fout,"%c",ans[i]);
					if(ans[i]=='\n')
					{
						++i;
						break;
					}
				}
			}
		}
		void std_print(FILE *fout)
		{
			fwrite(ans,sizeof(char),size,fout);
		}
};
stu_ans stu,src;
int main()
{
	ifstuans=fopen("stu_ans.in","r");
	ifstd=fopen("src.cpp","r");
	ofstd=fopen("std.cpp","a");
	stu.init(ifstuans);
	src.init(ifstd);
	stu.ans_print(ofstd);
	src.std_print(ofstd);
	return 0; 
}

i<=j
next[rank[i]]=rank[i+1]
higher=height[next[i]]-height[i]
shorter<higher
previous[next[i]]=previous[i]
// 最后一行有换行~

#define ____1____ i<=j
#define ____2____ next[rank[i]]=rank[i+1]
#define ____3____ higher=height[next[i]]-height[i]
#define ____4____ shorter<higher
#define ____5____ previous[next[i]]=previous[i]
#include <iostream>
using namespace std;
#define MAXN 200000
#define infinity 2147483647
int answer[MAXN], height[MAXN], previous[MAXN], next[MAXN];
int rank[MAXN];
int n;
void sort(int l, int r)
{
    int x = height[rank[(l + r) / 2]], i = l, j = r, temp;
    while (i <= j)
    {
        while (height[rank[i]] < x)
            i++;
        while (height[rank[j]] > x)
            j--;
        if ((____1____))
        {
            temp = rank[i];
            rank[i] = rank[j];
            rank[j] = temp;
            i++;
            j--;
        }
    }
    if (i < r)
        sort(i, r);
    if (l < j)
        sort(l, j);
}
int main()
{
    cin >> n;
    int i, higher, shorter;
    for (i = 1; i <= n; i++)
    {
        cin >> height[i];
        rank[i] = i;
	}
	sort(1, n);
	for (i = 1; i <= n; i++)
	{
		previous[rank[i]] = rank[i - 1];
		(____2____);
	}
	for (i = n; i >= 2; i--)
	{
		higher = shorter = infinity;
		if (previous[i] != 0)
			shorter = height[i] - height[previous[i]];
		if (next[i] != 0)
			(____3____);
		if ((____4____))
			answer[i] = previous[i];
		else
			answer[i] = next[i];
		next[previous[i]] = next[i];
		(____5____);
	}
	for (i = 2; i <= n; i++)
		cout << i << ":" << answer[i];
	return 0;
}
//OK