搜狐第一题

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	vector<int> rec(m, 0);
	for (int i = 0; i < m; ++i)
		cin >> rec[i];
	vector<int> result(n, 0);
	result[0] = rec[0];
	int count = 1;
	int index = 1;
	for (int i = 1; i < n; ++i) {
		if (result[i - 1] != 1) {
			count++;
			if (count <= result[i - 1]) {
				result[i] = result[i - 1];
			}
			else {
				count = 1;
				if (index < m) {
					result[i] = rec[index++];
				}
				else {
					index = 0;
					result[i] = rec[index++];
				}
			}
		}
		else {
			if (index < m) {
				result[i] = rec[index++];
			}
			else {
				index = 0;
				result[i] = rec[index++];
			}
		}
	}
	vector<int> vec;
	int ind = 0;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < result[i]; ++j) {
			ind = ind%m;
			vec.push_back(rec[ind]);
		}
		ind++;
		if (vec.size() >= n)
			break;
	}
	for (int i = 0; i < n; ++i)
		cout << vec[i] << endl;
	return 0;
}