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]);
    }
}


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

相关文章推荐

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

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

UVA 111 History Grading 最长公共子序列

最长公共子序列,算法导论上有。唯一要注意的是这段话 Given the correct chronological order of n events    as  where   denote...
  • whu_zxl
  • whu_zxl
  • 2012年07月28日 10:48
  • 605

uvaoj 111 History Grading 最长公共子序列LCS

uvaoj 111 History Grading
  • gwq5210
  • gwq5210
  • 2014年10月31日 00:16
  • 415

UVa 111 - History Grading 最长递增子序列 LIS

History Grading  Background Many problems in Computer Science involve maximizing som...
  • cyendra
  • cyendra
  • 2013年04月22日 16:10
  • 767

AYITACM2016省赛第二周 G - History Grading历史评分(最长公共子序列)

Description Background Many problems in Computer Science involve maximizing some measure a...

最长公共子序列-History Grading

History Grading

uva10723(dp 最长公共子序列)

题目的意思就是给你两个串,然后你构造一个串,使这两个串都是它的子串.并且这个串要最短. 问最短多长,还有构造成最短长度的方法有几种. 首先我们可以知道,如果把两个串合并成一个串,肯定是可以...

UVA 10100- Longest Match(dp之最长公共子序列)

题目地址:UVA 10100 题意:求两组字符串中最大的按顺序出现的相同单词数目。 思路:将字串中的连续的字母认作一个单词,依次计算出两个字符串中的单词,其中第1个字符串的单词序列为t1.word...

UVA DP入门专题(二)最长公共子序列 打印方法

10285 - Longest Run on a Snowboard 4910 55.11% 2036 93.76% ...

UVa 10066 Twin Towers (DP 最长公共子序列)

题意  求两串数字最长公共子序列的长度 裸的lcs没啥说的 #include #include #include using namespace std; const int ma...
  • acvay
  • acvay
  • 2014年08月22日 15:50
  • 732
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:UVA 111 History Grading(最长公共子序列dp)
举报原因:
原因补充:

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