uva111(dp)
来源:互联网 发布:java transient 作用 编辑:程序博客网 时间:2024/05/20 05:54
Description
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 eventi in the correct chronological order and a sequence of student responses where denotes the chronological rank given by the student to eventi; 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 containn integers, indicating the correct chronological order of n events. The remaining lines will each consist ofn integers with each line representing a student's chronological ordering of the n events. All lines will containn 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
看到第二组数据的时候才发现
理解错这道题了
这道题的输入有点坑
4231 这是第一个历史事件发生的顺序是第四 第二个历史时间发生的顺序是第二 .. 第四个历史时间第一个发生
一开始想当然的认为第一个发生的是事件4, 事件2...
#include <stdio.h>#include <string.h>int order[25], arr[25], d[25][25];int max(int x, int y){if (x > y)return x;elsereturn y;}int main(){int n, t;scanf("%d", &n);for (int i = 0; i < n; i++) {scanf("%d", &t);order[t - 1] = i + 1;}while (scanf("%d", &t) != EOF) {arr[t - 1] = 1;for (int i = 1; i < n; i++) {scanf("%d", &t);arr[t - 1] = i + 1; //这才是正确的顺序 输入需要改}memset(d, 0, sizeof(d));for (int i = 1; i <= n; i++)for (int j = 1; j <= n; j++) {if (order[i - 1] == arr[j - 1])d[i][j] = d[i - 1][j - 1] + 1;elsed[i][j] = max(d[i - 1][j], d[i][j - 1]);}printf("%d\n", d[n][n]);}return 0;}求出最长公共子序列长度
- UVA111 (DP)
- uva111(dp)
- UVa111
- uva111
- uva111
- uva111
- UVA111 History Grading 简单的DP
- UVA111 LCS
- uva111---History Grading
- uva10003+uva765+uva111
- [动态规划]UVA111 - History Grading
- UVA111最长公共子序列
- uva111 - History Grading(历史考试)
- uva111 - History Grading(最长公共子序列LCS)
- uva111 lcs 但是和顺序是有关的
- dp
- dp
- dp
- 【SSH项目实战】国税协同平台-4.用户管理需求分析&CRUD方法1
- AES加密,128-192-256,方案二
- Kinect工作流程
- 【SSH项目实战】国税协同平台-4.用户管理需求分析&CRUD方法2
- 查看virsh管理qemu虚拟机日志信息和libvirtd日志信息
- uva111(dp)
- Java 程序性能优化《第一章》Java性能调优概述 1.3基本调优策略和手段
- Android从源码分析二:AsyncTask异步任务
- 【SSH项目实战】国税协同平台-5.头像上传功能
- 关于友盟自定义视图实现分享 (微信朋友 微信朋友圈 微信收藏)
- haproxy 配置
- 移动H5前端性能优化指南
- 国税协同平台-6.POI导出用户列表
- 关于有偿提供拼图响应式后台的通知