华为2016校园招聘上机笔试题(1,2题)

[编程题]最高分是多少

#include <bits/stdc++.h>
using namespace std;
const int N = 30010;
const int M = 5010;
int a[N];
int n, m;
int _;
void solve()
{
	while (cin >> n >> m)
	{
		for (int i = 1; i <= n; i++)cin >> a[i];
		vector<int>v;
		while (m--)
		{
			char c;
			int x, y;
			cin >> c >> x >> y;
			if (c == 'Q')
			{
				if (x > y)swap(x, y);
				int maxv = -1;
				for (int i = x; i <= y; i++)maxv = max(maxv, a[i]);
				v.push_back(maxv);
			}
			else if (c == 'U')a[x] = y;
		}
		for (auto x : v)cout << x << endl;
	}
}
int main()
{
	solve();
	return 0;
}

[编程题]简单错误记录

#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int N = 1010;
typedef pair<string, int>PSI;
vector<PSI>v;
bool cmp(PSI a, PSI b)
{
	return a.y > b.y;
}
int main()
{
	string s;
	while (getline(cin, s))
	{
		if (s.size() == 0)break;
		int idx = s.rfind("\\");
		s = s.substr(idx + 1);
		v.push_back({ s,1 });
		for (int i = 0; i < v.size() - 1; i++)
		{
			if (v[i].x == s)
			{
				v[i].y++;
				v.pop_back();
				break;
			}
		}
	}
	sort(v.begin(), v.end(), cmp);
	for (int i = 0; i < min(8, (int)v.size()); i++)
	{
		int len = v[i].x.find(' ');
		if (len > 16)
			v[i].x = v[i].x.substr(len - 16);
		cout << v[i].x << ' ' << v[i].y << endl;
	}
	return 0;
}