UVA 111 History Grading(最长公共子序列dp)

原创 2015年07月11日 01:09:37

A - History Grading
Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Description

Download as PDF

Background

Many problems in Computer Science involve maximizing some measure according to constraints.

Consider a history exam in which students are asked to put several historical events into chronological order. Students who order all the events correctly will receive full credit, but how should partial credit be awarded to students who incorrectly rank one or more of the historical events?

Some possibilities for partial credit include:

  1. 1 point for each event whose rank matches its correct rank
  2. 1 point for each event in the longest (not necessarily contiguous) sequence of events which are in the correct order relative to each other.

For example, if four events are correctly ordered 1 2 3 4 then the order 1 3 2 4 would receive a score of 2 using the first method (events 1 and 4 are correctly ranked) and a score of 3 using the second method (event sequences 1 2 4 and 1 3 4 are both in the correct order relative to each other).

In this problem you are asked to write a program to score such questions using the second method.

The Problem

Given the correct chronological order of n events tex2html_wrap_inline34 as tex2html_wrap_inline36 where tex2html_wrap_inline38 denotes the ranking of event i in the correct chronological order and a sequence of student responses tex2html_wrap_inline42 where tex2html_wrap_inline44 denotes the chronological rank given by the student to event i; determine the length of the longest (not necessarily contiguous) sequence of events in the student responses that are in the correct chronological order relative to each other.

The Input

The first line of the input will consist of one integer n indicating the number of events with tex2html_wrap_inline50 . The second line will contain nintegers, indicating the correct chronological order of n events. The remaining lines will each consist of n integers with each line representing a student's chronological ordering of the n events. All lines will contain n numbers in the range tex2html_wrap_inline60 , with each number appearing exactly once per line, and with each number separated from other numbers on the same line by one or more spaces.

The Output

For each student ranking of events your program should print the score for that ranking. There should be one line of output for each student ranking.

Sample Input 1

4
4 2 3 1
1 3 2 4
3 2 1 4
2 3 4 1

Sample Output 1

1
2
3

Sample Input 2

10
3 1 2 4 9 5 10 6 8 7
1 2 3 4 5 6 7 8 9 10
4 7 2 3 10 6 9 1 5 8
3 1 2 4 9 5 10 6 8 7
2 10 1 3 8 4 9 5 7 6

Sample Output 2

6
5
10
9


题意:给出n个event在第几个发生。比如4,3,2,1表示1在4时发生,2在3时发生,3在2时发生,转化好后求LCS

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define maxn 1005
#define inf 0x3f3f3f3f
int a[25];
int b[25];
int dp[25][25];
int main()
{
    int n;
    //freopen("in.txt","r",stdin);
    scanf("%d",&n);
    int t;
    for(int i=1;i<=n;i++){
        scanf("%d",&t);
        a[t]=i;
    }
    while(~scanf("%d",&t)){
        b[t]=1;
        for(int i=2;i<=n;i++){
            scanf("%d",&t);
            b[t]=i;
        }
        memset(dp,0,sizeof dp);
        for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++){
            if(a[i]==b[j])dp[i][j]=dp[i-1][j-1]+1;
            else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
        }
        printf("%d\n",dp[n][n]);
    }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

最长公共子序列(LCS问题)的DP解法

呃。。大一做过,毕竟是ACM入门DP题,但是大三的我已然忘了具体咋做了,只记得是DP,面试常会问这个问题,所以有必要搞明白。 题目描述略。 解题思想就是DP,DP无外乎需要知道两个东西,一是状态是什么...
  • u013303743
  • u013303743
  • 2016年04月23日 10:40
  • 708

LCS 最长公共子序列(DP经典问题)

最长公共子序列问题以及背包问题都是DP(动态规划)算法的经典题目,值得深度挖掘以致了解DP算法思想。问题如下: 最长公共子序列 时间限制:3000 ms  |  内存限制:6553...
  • u014492609
  • u014492609
  • 2014年08月08日 15:48
  • 1257

最长公共子序列与最长公共子串(DP)

1. 问题描述 子串应该比较好理解,至于什么是子序列,这里给出一个例子:有两个母串 cnblogsbelong 比如序列bo, bg, lg在母串cnblogs与belong中都出现过并且出现顺序...
  • u012102306
  • u012102306
  • 2016年11月16日 11:14
  • 3838

uva 111 History Grading(动态规划——最长公共子序列)

1、http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=47 ...
  • sdjzping
  • sdjzping
  • 2013年08月08日 16:08
  • 970

UVA 111 History Grading (最长公共子序列)

History Grading Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Background...
  • xia842655187
  • xia842655187
  • 2016年04月20日 19:21
  • 763

【openjudge 1759】最长上升子序列(dp)

松叶正秋琴韵响,菱花初晓镜光寒
  • reverie_mjp
  • reverie_mjp
  • 2016年11月01日 21:54
  • 259

动态规划 最长公共子序列 过程图解

1.基本概念       首先需要科普一下,最长公共子序列(longest common sequence)和最长公共子串(longest common substring)不是一回事儿。什么是子序...
  • hrn1216
  • hrn1216
  • 2016年05月29日 22:54
  • 41496

最长公共子序列(LCS)

1、LCS基本概念          子序列:一个序列X任意删除若干个字符得到新序列Z,则Z叫做X的子序列。例如Z=是X=B,C,B,D,A,B>的子序列,相当于删除A、B、A。          公...
  • DQ_DM
  • DQ_DM
  • 2015年04月14日 16:18
  • 7611

【动态规划】输出所有的最长公共子序列

上篇讲到使用动态规划可以在 θ(mn) 的时间里求出 LCS 的长度,本文将讨论如何输出最长公共子序列。 问题描述:给定两个序列,例如 X = “ABCBDAB”、Y = “BDCABA”,求它们的最...
  • lisong694767315
  • lisong694767315
  • 2014年11月29日 15:41
  • 6900

C++实现最长公共子序列和最长公共子串

转载自:点击打开链接 #include "stdafx.h" #include #include using namespace::std; int lcs(string str1, st...
  • chengonghao
  • chengonghao
  • 2016年07月14日 21:36
  • 5755
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:UVA 111 History Grading(最长公共子序列dp)
举报原因:
原因补充:

(最多只允许输入30个字)