POJ Railroad ——记忆化搜索

本文探讨了在铁路列车融合过程中,如何通过记忆化搜索优化排列顺序,以满足预定的产品需求顺序。通过输入两个列车中产品类型及期望的最终排列顺序,判断是否能够实现这一目标。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Description

A train yard is a complex series of railroad tracks for storing, sorting, or loading/unloading railroad cars. In this problem, the railroad tracks are much simpler, and we are only interested in combining two trains into one.



Figure 1: Merging railroad tracks.


The two trains each contain some railroad cars. Each railroad car contains a single type of products identified by a positive integer up to 1,000,000. The two trains come in from the right on separate tracks, as in the diagram above. To combine the two trains, we may choose to take the railroad car at the front of either train and attach it to the back of the train being formed on the left. Of course, if we have already moved all the railroad cars from one train, then all remaining cars from the other train will be moved to the left one at a time. All railroad cars must be moved to the left eventually. Depending on which train on the right is selected at each step, we will obtain different arrangements for the departing train on the left. For example, we may obtain the order 1,1,1,2,2,2 by always choosing the top train until all of its cars have been moved. We may also obtain the order 2,1,2,1,2,1 by alternately choosing railroad cars from the two trains.

To facilitate further processing at the other train yards later on in the trip (and also at the destination), the supervisor at the train yard has been given an ordering of the products desired for the departing train. In this problem, you must decide whether it is possible to obtain the desired ordering, given the orders of the products for the two trains arriving at the train yard.
 

Input

The input consists of a number of cases. The first line contains two positive integers N 1 N 2 which are the number of railroad cars in each train. There are at least 1 and at most 1000 railroad cars in each train. The second line contains N 1 positive integers (up to 1,000,000) identifying the products on the first train from front of the train to the back of the train. The third line contains N 2 positive integers identifying the products on the second train (same format as above). Finally, the fourth line contains N 1+N 2 positive integers giving the desired order for the departing train (same format as above).

The end of input is indicated by N 1 = N 2 = 0.
 

Output

For each case, print on a line possible if it is possible to produce the desired order, or not possible if not.
 

Sample Input

     
3 3 1 2 1 2 1 1 1 2 1 1 2 1 3 3 1 2 1 2 1 2 1 1 1 2 2 2 0 0
 

Sample Output

     
possible not possible 此题还算不错的题目,可以当记忆化搜索的入门题目,不是经常做搜索题目。导致对以前的记忆化搜索生疏起来,根本思想就是观察每种情况的自清况可不可能重复,如果会的化,那么 可以通过记忆化搜索来剪枝。

/*
 * File:   main.cpp
 * Author: hit-acm
 *
 * Created on 2012年7月23日, 下午1:10
 */

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int m, n;
const int MAX = 1001;
int a[MAX];
int b[MAX];
int c[2 * MAX];
bool color[MAX][MAX];
/*
 *
 */
bool flag;

void DFS(int x, int y, int i) {
    if (color[x][y]) {
        return;
    }
    if (flag == true) {
        return;
    }

    if (i >= m + n) {
        flag = true;
        return;
    }

    if (x < n && a[x] == c[i]) {
        DFS(x + 1, y, i + 1);
    }

    if (y < m && b[y] == c[i]) {
        DFS(x, y + 1, i + 1);
    }
    color[x][y] = true;
}

int main() {
    while (scanf("%d%d", &n, &m) && (m || n)) {
        for (int i = 0; i < n; i++) {
            scanf("%d", &a[i]);
        }

        for (int j = 0; j < m; j++) {
            scanf("%d", &b[j]);
        }

        for (int i = 0; i < m + n; i++) {
            scanf("%d", &c[i]);
        }

        flag = false;
        memset(color, 0, sizeof (color));
        DFS(0, 0, 0);
        if (flag) {
            printf("possible\n");
        } else {
            printf("not possible\n");
        }
    }
    return 0;
}



资源下载链接为: https://pan.quark.cn/s/1bfadf00ae14 “STC单片机电压测量”是一个以STC系列单片机为基础的电压检测应用案例,它涵盖了硬件电路设计、软件编程以及数据处理等核心知识点。STC单片机凭借其低功耗、高性价比和丰富的I/O接口,在电子工程领域得到了广泛应用。 STC是Specialized Technology Corporation的缩写,该公司的单片机基于8051内核,具备内部振荡器、高速运算能力、ISP(在系统编程)和IAP(在应用编程)功能,非常适合用于各种嵌入式控制系统。 在源代码方面,“浅雪”风格的代码通常简洁易懂,非常适合初学者学习。其中,“main.c”文件是程序的入口,包含了电压测量的核心逻辑;“STARTUP.A51”是启动代码,负责初始化单片机的硬件环境;“电压测量_uvopt.bak”和“电压测量_uvproj.bak”可能是Keil编译器的配置文件备份,用于设置编译选项和项目配置。 对于3S锂电池电压测量,3S锂电池由三节锂离子电池串联而成,标称电压为11.1V。测量时需要考虑电池的串联特性,通过分压电路将高电压转换为单片机可接受的范围,并实时监控,防止过充或过放,以确保电池的安全和寿命。 在电压测量电路设计中,“电压测量.lnp”文件可能包含电路布局信息,而“.hex”文件是编译后的机器码,用于烧录到单片机中。电路中通常会使用ADC(模拟数字转换器)将模拟电压信号转换为数字信号供单片机处理。 在软件编程方面,“StringData.h”文件可能包含程序中使用的字符串常量和数据结构定义。处理电压数据时,可能涉及浮点数运算,需要了解STC单片机对浮点数的支持情况,以及如何高效地存储和显示电压值。 用户界面方面,“电压测量.uvgui.kidd”可能是用户界面的配置文件,用于显示测量结果。在嵌入式系统中,用
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值