昨晚搜狐第一题 ac
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> dict(m);
for (auto i = 0; i != m; ++i)
cin >> dict[i];
vector<int> res;
int begin = 0;
int index = 0;
bool flag = false;
if (dict[0] == 1) { res.push_back(1); ++begin; ++index; flag = true; }
while (begin < n)
{
if (index == m) index = 0;
if (begin == 0 || flag)
{
for (auto i = 0; i != dict[index]; ++i)
res.push_back(dict[index]);
flag = false;
}
else
{
for (auto i = 0; i != res[begin]; ++i)
res.push_back(dict[index]);
}
++begin;
++index;
}
for (auto i = 0; i != n; ++i)
cout << res[i] << endl;
return 0;
}
#搜狐#
投递网易有道等公司10个岗位
