求助,最后一个点TLEqwq
查看原帖
求助,最后一个点TLEqwq
336781
末置lzy楼主2020/10/24 09:14

代码如下 最后一个点TLE了,各位带佬,怎么优化啊qwq

#include<iostream>
#include<string>
using namespace std;
struct P1781
{
	string r;
	int w;
}a[30];
int main()
{
	string maxr;
	int n,len,maxi;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i].r;
		a[i].w = i;
		len = max(len, (int)(a[i].r).length());
	}
	for (int i = 1; i <= n; i++)
	{
		while ((int)(a[i].r).length() <= len)
		{
			a[i].r = ' ' + a[i].r;
		}
		if (a[i].r > maxr)
		{
			maxr = a[i].r;
			maxi = a[i].w;
		}
	}
	cout << maxi << endl;
	for (int i = 1; i <= len; i++)
	{
		if (maxr[i] != ' ') cout << maxr[i];
	}
	return 0;
}
2020/10/24 09:14
加载中...