最长公共子序列-History Grading
来源:互联网 发布:奶瓶 linux 编辑:程序博客网 时间:2024/05/22 14:59
History Grading
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 point for each event whose rank matches its correct rank
- 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 as where denotes the ranking of event i in the correct chronological order and a sequence of student responses where 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 . 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 , 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
44 2 3 11 3 2 42 3 4 13 2 1 4
Sample Output 1
123
Sample Input 2
103 1 2 4 9 5 10 6 8 71 2 3 4 5 6 7 8 9 103 1 2 4 9 5 10 6 8 74 7 2 3 10 6 9 1 5 82 10 1 3 8 4 9 5 7 6
Sample Output 2
65109
#include<stdio.h>#include<string.h>int main(){ int n,i,s[25],c[25],dp[25][25],cnt,j,o; scanf("%d",&n); for(i=1; i<=n; i++) { scanf("%d",&o); s[o]=i; } while(scanf("%d",&o)!=EOF) { c[o]=1; memset(dp,0,sizeof(dp)); for(i=2; i<=n; i++) { scanf("%d",&o); c[o]=i; } for(i=1; i<=n; i++) { for(j=1; j<=n; j++) { if(c[i]==s[j]) { dp[i][j]=1+(dp[i-1][j]>dp[i][j-1]?dp[i-1][j]:dp[i][j-1]); } else dp[i][j]=dp[i-1][j]>dp[i][j-1]?dp[i-1][j]:dp[i][j-1]; } } /* for(i=1; i<=n; i++) { for(j=1; j<=n; j++) { printf("%d ",dp[i][j]); } printf("\n"); }*/ printf("%d\n",dp[n][n]); }}
- 最长公共子序列-History Grading
- UVA 111 History Grading 最长公共子序列
- dp 最长公共子序列 uva 111-History Grading
- UVa 111 - History Grading (最长公共子序列)
- UVa 111 History Grading (最长公共子序列)
- Uva-111 History Grading 裸最长公共子序列
- UVA-111 History Grading(dp+最长公共子序列)
- uvaoj 111 History Grading 最长公共子序列LCS
- UVA - 111 History Grading 最长公共子序列
- uva 111 History Grading 最长公共子序列
- UVA 111 History Grading(最长公共子序列dp)
- uva111 - History Grading(最长公共子序列LCS)
- UVA 111 History Grading (最长公共子序列)
- History Grading - UVa 111 最长公共子序列 注意序列输入
- uva 111 History Grading(动态规划——最长公共子序列)
- AYITACM2016省赛第二周 G - History Grading历史评分(最长公共子序列)
- UVA 111 History Grading(题意杀,最长公共子序列)
- History Grading dp+求最长公共子串
- java异常
- 使用 Cocos2d-x 和粒子编辑器实现“天天爱消除”场景特效
- 获取数据库内容,关键代码
- WinDbg Tutorial
- Android的R文件出错问题
- 最长公共子序列-History Grading
- Java基础温习 (6)重载,重写以及继承,多态的区别
- andoid sys bug 转载
- 编译生成适合于arm平台使用的mp4v2(学习了交叉编译呀)
- TCP三次握手&关闭
- UVA 1471 Average
- V$SESSION_WAIT
- 【第二回】使用OCCT实现对一个瓶子建模的总结
- 对程序的磁盘映像、内存映像、地址空间的理解 ,和 ls、size 命令