UVa 111 History Grading (DP&LCS)
来源:互联网 发布:关于大数据存储论文 编辑:程序博客网 时间:2024/05/22 03:42
111 - History Grading
Time limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=47
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 n integers, 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 43 2 1 42 3 4 1
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 104 7 2 3 10 6 9 1 5 83 1 2 4 9 5 10 6 8 72 10 1 3 8 4 9 5 7 6
Sample Output 2
65109
完整代码:
/*0.016s*/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int dp[25][25], a[25], b[25];int main(void){int n, temp;scanf("%d", &n);for (int i = 0; i < n; i++){scanf("%d", &temp);a[temp - 1] = i;}while (~scanf("%d", &temp)){memset(dp, 0, sizeof(dp));b[temp - 1] = 0;for (int i = 1; i < n; i++){scanf("%d", &temp);b[temp - 1] = i;///这样写也可以}for (int i = 1; i <= n; i++)for (int j = 1; j <= n; j++)dp[i][j] = (b[j - 1] == a[i - 1] ? dp[i - 1][j - 1] + 1: max(dp[i - 1][j], dp[i][j - 1]));printf("%d\n", dp[n][n]);}return 0;}
- UVA 111 History Grading(dp + LCS)
- UVa 111 History Grading (DP&LCS)
- Uva 111-History Grading(DP/LCS)
- uva 111 - History Grading LCS
- uva 111 History Grading(LCS)
- UVA 111 History Grading 【lcs】
- uva History Grading lcs
- 【DP】UVA 111 History Grading
- uva--111History Grading +dp
- uva 111 - History Grading(LCS)
- UVA - 111 - History Grading (LCS)
- uva 111 History Grading(DP初步应用)
- UVA - 111 History Grading (动态规划:LCS)
- uva 111 History Grading(动态规划:LCS)
- UVa 111 - History Grading
- uva 111 History Grading
- [UVA 111] History Grading
- uva:111 - History Grading
- join命令
- 子数组最大和问题
- IEEE 802.1d协议
- MySQL中关于日期、时间的数据类型和函数
- 名词王国里的死刑(java 面向对象的思考)
- UVa 111 History Grading (DP&LCS)
- 人工费广告费
- MFC中关于设备(屏幕)坐标和逻辑坐标
- Makefile中wildcard的使用
- Linux桌面配置文件
- 反复推进区间开头和末尾, 求解最小区间
- emulator-5554 disconnected!
- 今天你不改变,明天你将被别人改变!
- java 解析properties 文件