| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
过了的朋友看看这段代码错在哪?#include <stdio.h>
const int N = 1010;
int n, req[N], rail[N];
int main() {
int i, j, top;
while(scanf("%d", &n), n) {
while(1) {
for(i = 0; i<n; i++) {
scanf("%d", req+i);
if(req[i] == 0) break;
}
if(i != n) break;
for(i = 1, j = 0, top = 0; i<=n && j<n; i++, j++)
while(i != req[j] && i<=n && j<n)
rail[top++] = i++;
while(top > 0) {
if(rail[top-1] == req[j++]) top--;
else break;
}
if(top == 0) printf("Yes\n");
else printf("No\n");
}
putchar('\n');
}
return 0;
}
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator