「CF415A」Mashmokh and Lights
Mashmokh works in a factory. At the end of each day he must turn off all of the lights.
The lights on the factory are indexed from 1 to n. There are n buttons in Mashmokh’s room indexed from 1 to n as well. If Mashmokh pushes button with index i, then each light with index not less thani that is still turned on turns off.
Mashmokh is not very clever. So instead of pushing the first button he pushes some of the buttons randomly each night. He pushed m distinct buttons b1, b2, …, bm (the buttons were pushed consecutively in the given order) this night. Now he wants to know for each light the index of the button that turned this light off. Please note that the index of button bi is actually bi, not i.
Please, help Mashmokh, print these indices.
The first line of the input contains two space-separated integers n and m (1 ≤ n, m ≤ 100), the number of the factory lights and the pushed buttons respectively. The next line contains m distinct space-separated integers b1, b2, …, bm (1 ≤ bi ≤ n).
It is guaranteed that all lights will be turned off after pushing all buttons.
Output n space-separated integers where the i-th number is index of the button that turns the i-th light off.
|
1 2 |
5 4 4 3 1 2 |
|
1 |
1 1 3 4 4 |
|
1 2 |
5 5 5 4 3 2 1 |
|
1 |
1 2 3 4 5 |
In the first sample, after pressing button number 4, lights 4 and 5 are turned off and lights 1, 2 and 3 are still on. Then after pressing button number 3, light number 3 is turned off as well. Pressing button number 1 turns off lights number 1 and 2 as well so pressing button number 2 in the end has no effect. Thus button number 4 turned lights 4 and 5 off, button number 3 turned light 3 off and button number 1 turned light 1 and 2 off.
题解
模拟不解释
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; int n,m,a[101]; int main() { scanf("%d%d",&n,&m); for(int i=1;i<=m;i++) { int x;scanf("%d",&x); for(int j=x;j<=n;j++) { if(a[j])break; a[j]=x; } } for(int i=1;i<=n;i++) printf("%d ",a[i]); return 0; } |
OI 课件=>
