Submission #1386740

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxx = 1e5 + 20;

ll sz, qu[maxx], n, q, t[maxx], ps[maxx], b[maxx];
stack<int> stk;
vector<int> v;

int main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> q;
	stk.push(n);
	for(int i = 0; i < q; i++)
	{
		cin >> qu[i];
		while (stk.size() && stk.top() >= qu[i])
			stk.pop();
		stk.push(qu[i]);
	}
	while (stk.size()) v.push_back(stk.top()), stk.pop();
	for(int i = 0; i < v.size(); i++) b[i] = -v[i];
	reverse(v.begin(), v.end());
	sz = v.size();
	t[sz-1] = 1;
	for(int i = sz - 1; i >= 0; i--)
	{
		int k = v[i];
		while (i && k >= v[0])
		{
			int r = lower_bound(b + sz - i, b + sz, -k) - b;
//			cout << i << "     " << r << " " << b[r] << " " << k << endl;
			t[sz - r - 1] += (t[i] * (k / (-b[r])));
			k = (k % (-b[r]));
//			return 0; 
		}
		ps[k] += t[i];
//		if (i == 0) break;
	}
//	ps[n] = t[n];
	for(int i = n - 1; i >= 0; i--) ps[i] = (ps[i+1] + ps[i]);
	for(int i = 1; i <= n; i++) cout << ps[i] << '\n'; 
	return 0;
}

Submission Info

Judge Result