Rails (UVa 514) (창고)
4191 단어 알고리즘 입문 고전 (UVa)데이터 구조
There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to establish only a surface track. Moreover, it turned out that the station could be only a dead-end one (see picture) and due to lack of available space it could have only one track.
The local tradition is that every train arriving from the direction A continues in the direction B with coaches reorganized in some way. Assume that the train arriving from the direction A has coaches numbered in increasing order . The chief for train reorganizations must know whether it is possible to marshal coaches continuing in the direction B so that their order will be . Help him and write a program that decides whether it is possible to get the required order of coaches. You can assume that single coaches can be disconnected from the train before they enter the station and that they can move themselves until they are on the track in the direction B. You can also suppose that at any time there can be located as many coaches as necessary in the station. But once a coach has entered the station it cannot return to the track in the direction A and also once it has left the station in the direction B it cannot return back to the station.
Input
The input file consists of blocks of lines. Each block except the last describes one train and possibly more requirements for its reorganization. In the first line of the block there is the integer
N
described above. In each of the next lines of the block there is a permutation of
The last line of the block contains just 0.
The last block consists of just one line containing 0.
Output
The output file contains the lines corresponding to the lines with permutations in the input file. A line of the output file contains
Yes
if it is possible to marshal the coaches in the order required on the corresponding line of the input file. Otherwise it contains
No
. In addition, there is one empty line after the lines corresponding to one block of the input file. There is no line in the output file corresponding to the last ``null'' block of the input file.
Sample Input
5
1 2 3 4 5
5 4 1 2 3
0
6
6 5 4 3 2 1
0
0
Sample Output
Yes
No
Yes
, , 。 ,
, 。
A ,B target 。B B
:
#include
#include using namespace std; const int MAXN=1000+10; int target[MAXN]; int main() { int n,A,B,ok; while(scanf("%d",&n),n) { stack s; while(1){ scanf("%d",&target[1]); if(target[1]==0) break; { for(int i=2;i<=n;i++) { scanf("%d",&target[i]); } A=B=ok=1; while(B<=n) // B n, 。 { // C B , B if(A==target[B]) { A++,B++;} // , ( C ) B else if(!s.empty()&&s.top()==target[B]) {s.pop(),B++;} // C else if(A<=n) s.push(A++); // C, , target else { ok=0; break; } } printf("%s
",ok?"Yes":"No");}} printf("
"); } }
hdoj 1022 라 는 문 제 를 풀 어 본 후에 저 는 똑 같은 사고 로 이 문 제 를 해결 할 수 있다 는 것 을 알 게 되 었 습 니 다. 사고 와 코드 가 모두 이해 하기 쉽 습 니 다 ~#include
#include using namespace std; int b[1010]; int main() { int i,n,k,t; stack s; while(scanf("%d",&n),n) { while(1){ while(!s.empty()) // ~ WA 。。。 { s.pop(); } k=t=0; scanf("%d",&b[0]); if(b[0]==0) break; for(i=1;i
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
Sparse Table을 아십니까? 나는 알고 있다.Sparse Table을 지금 배웠으므로, 메모를 겸해 씁니다. 불변의 수열의 임의의 구간에 대한 최소치/최대치를, 전처리 $O(N\log N)$, 쿼리 마다 $O(1)$ 로 구하는 데이터 구조입니다. 숫자 열의 값...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.