UVa 514 Rails(stack)
2013-03-13 22:00
483 查看
又犯了输出错误,从现在起,以后没提交一道题之前,都必须要再审一遍输出
根据先进后出,可以推断,如果有一个这样的图形,r[i] > r[i-1] && r[i] < r[i-2] 那么就一定不符合
代码如下:
#include <cstdio>
#include <cstring>
using namespace std;
int n, rail[1010];
int main()
{
while ( scanf("%d", &n) != EOF && n ) {
while ( scanf("%d", &rail[0]), rail[0] ) {
bool is = true, now = true;
for ( int i = 1; i < n; ++i ) scanf("%d", &rail[i]);
for ( int i = 1; i < n; ++i )
if ( rail[i] < rail[i-1] ) now = 0;
else if ( now == 0 && ( rail[i] > rail[i-1] && rail[i] < rail[i-2] ) ) { is = false; break; }
else if ( now == 0 && ( rail[i] > rail[i-1] && rail[i] > rail[i-2] ) ) now = true;
if ( is ) printf("Yes\n");
else printf("No\n");
}
printf("\n");
}
}
根据先进后出,可以推断,如果有一个这样的图形,r[i] > r[i-1] && r[i] < r[i-2] 那么就一定不符合
代码如下:
#include <cstdio>
#include <cstring>
using namespace std;
int n, rail[1010];
int main()
{
while ( scanf("%d", &n) != EOF && n ) {
while ( scanf("%d", &rail[0]), rail[0] ) {
bool is = true, now = true;
for ( int i = 1; i < n; ++i ) scanf("%d", &rail[i]);
for ( int i = 1; i < n; ++i )
if ( rail[i] < rail[i-1] ) now = 0;
else if ( now == 0 && ( rail[i] > rail[i-1] && rail[i] < rail[i-2] ) ) { is = false; break; }
else if ( now == 0 && ( rail[i] > rail[i-1] && rail[i] > rail[i-2] ) ) now = true;
if ( is ) printf("Yes\n");
else printf("No\n");
}
printf("\n");
}
}
相关文章推荐
- UVa--514 Rails (stack)
- UVa - 514 - Rails(栈-stack)
- stack&&UVa514 Rails (铁轨)的理解与解析
- 铁轨Rails UVA514(stack运用)
- UVa 514 (stack的使用) Rails
- 铁轨Rails UVA514(stack运用)
- UVA514 Rails (stack)
- Uva Oj 514 - Rails
- Rails,ACM/ICPC CERC 1997,UVa514
- UVa - 514 Rails(栈模拟)
- uva 514 Rails
- UVA-514 Rails
- UVA 514 铁轨 (Rails)
- UVa 514 - Rails
- UVA 514 Rails
- Uva514 Rails
- uva 514 Rails
- UVA 514 Rails(栈)
- Rails(UVa514)(栈)
- UVA 514 Rails