2016SDAU课程练习三1002

题目大意:

输出两个字符串,求公共子序列长度。

Sample Input
abcfbc abfcab programming contest abcd mnp

Sample Output
4 2 0

AC代码:

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
#include<string>
using namespace std;
char s1[1000] ,s2[1000];
int dp[1000][1000];
int leng1,leng2;
void get()
{
    memset(dp,0,sizeof(dp));//一定不能忘记!
    int i,j;

//核心代码:
    for(i=1;i<=leng1;i++)
        for(j=1;j<=leng2;j++)
        {
            if(s1[i-1]==s2[j-1])
            dp[i][j]=dp[i-1][j-1]+1;
        else
        dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
    }
}
int main()
{
    while(cin>>s1>>s2)//~scanf("%s%s",s1,s2)
    {
        leng1=strlen(s1);
        leng2=strlen(s2);
        get();
        cout<<dp[leng1][leng2]<<endl;
    }
    return 0;
}

1002

06-22

大家好,请问下面的题怎么做?rnSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. rnA blockhouse is a small castle that has four openings through which to shoot. The four openings are facing North, East, South, and West, respectively. There will be one machine gun shooting through each opening. rnHere we assume that a bullet is so powerful that it can run across any distance and destroy a blockhouse on its way. On the other hand, a wall is so strongly built that can stop the bullets. rnThe goal is to place as many blockhouses in a city as possible so that no two can destroy each other. A configuration of blockhouses is legal provided that no two blockhouses are on the same horizontal row or vertical column in a map unless there is at least one wall separating them. In this problem we will consider small square cities (at most 4x4) that contain walls through which bullets cannot run through. rnThe following image shows five pictures of the same board. The first picture is the empty board, the second and third pictures show legal configurations, and the fourth and fifth pictures show illegal configurations. For this board, the maximum number of blockhouses in a legal configuration is 5; the second picture shows one way to do it, but there are several other ways. rn rnYour task is to write a program that, given a description of a map, calculates the maximum number of blockhouses that can be placed in the city in a legal configuration. rnThe input file contains one or more map descriptions, followed by a line containing the number 0 that signals the end of the file. Each map description begins with a line containing a positive integer n that is the size of the city; n will be at most 4. The next n lines each describe one row of the map, with a '.' indicating an open space and an uppercase 'X' indicating a wall. There are no spaces in the input file. rnFor each test case, output one line containing the maximum number of blockhouses that can be placed in the city in a legal configuration. rnSample input: rn4rn.X.. rn.... rnXX.. rn.... rn2rnXXrn.Xrn3rn.X.rnX.Xrn.X.rn3rn...rn.XXrn.XXrn4rn....rn....rn....rn....rn0rnSample output: rn5rn1rn5rn2rn4rn

没有更多推荐了,返回首页

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试