USACO-2017-FEB-金组 Why Did the Cow Cross the Road II
来源:互联网 发布:小葫芦直播平台大数据 编辑:程序博客网 时间:2024/05/22 14:36
题目描述
Farmer John raises N breeds of cows (1≤N≤1000), conveniently numbered 1…N. Some pairs of breeds are friendlier than others, a property that turns out to be easily characterized in terms of breed ID: breeds a and b are friendly if |a−b|≤4, and unfriendly otherwise.
A long road runs through FJ’s farm. There is a sequence of N fields on one side of the road (one designated for each breed), and a sequence of N fields on the other side of the road (also one for each breed). To help his cows cross the road safely, FJ wants to draw crosswalks over the road. Each crosswalk should connect a field on one side of the road to a field on the other side where the two fields have friendly breed IDs (it is fine for the cows to wander into fields for other breeds, as long as they are friendly). Each field can be accessible via at most one crosswalk (so crosswalks don’t meet at their endpoints).
Given the ordering of N fields on both sides of the road through FJ’s farm, please help FJ determine the maximum number of crosswalks he can draw over his road, such that no two intersect.
输入
The first line of input contains N. The next N lines describe the order, by breed ID, of fields on one side of the road; each breed ID is an integer in the range 1…N. The last N lines describe the order, by breed ID, of the fields on the other side of the road. Each breed ID appears exactly once in each ordering.
输出
Please output the maximum number of disjoint “friendly crosswalks” Farmer John can draw across the road.
样例输入
6
1
2
3
4
5
6
6
5
4
3
2
1
样例输出
5
题意
给一个数n,后面有2*n个数,前n个代表马路一边的牛,后n个代表另一边的牛;
只要值相差不超过四就算匹配。问最多可以匹配几个。
思路
很显然,最长公共子序列。
直接上代码。
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;int a[1005][1005];int main (){#ifndef ONLINE_JUDGE freopen("1","r",stdin);#endif // ONLINE_JUDGE ios_base::sync_with_stdio(false); cin.tie(0); int n; int c[1005],b[1005]; while(cin>>n) { for(int i=1; i<=n; ++i) cin>>c[i]; for(int j=1; j<=n; ++j) cin>>b[j]; memset(a,0,sizeof(a)); for(int i=1; i<=n; ++i) for(int j=1; j<=n; ++j) { if(abs(b[i]-c[j])<=4) { a[i][j]=a[i-1][j-1]+1; } else a[i][j]=max(a[i][j-1],a[i-1][j]); } cout<<a[n][n]<<endl; } return 0;}/************************************************************** Language: C++ Result: 正确 Time:28 ms Memory:5632 kb****************************************************************/
- USACO-2017-FEB-金组 Why Did the Cow Cross the Road II
- USACO-2017-FEB-金组 Why Did the Cow Cross the Road
- USACO-2017-FEB-金组 Why Did the Cow Cross the Road III
- [Usaco2017 Feb]Why Did the Cow Cross the Road II
- 4992: [Usaco2017 Feb]Why Did the Cow Cross the Road
- bzoj4995: [Usaco2017 Feb]Why Did the Cow Cross the Road
- bzoj4989: [Usaco2017 Feb]Why Did the Cow Cross the Road
- Bzoj4989 [Usaco2017 Feb]Why Did the Cow Cross the Road
- [Usaco2017 Feb]Why Did the Cow Cross the Road
- [Usaco2017 Feb]Why Did the Cow Cross the Road III
- bzoj 4993: [Usaco2017 Feb]Why Did the Cow Cross the Road II
- BZOJ 4993: [Usaco2017 Feb]Why Did the Cow Cross the Road II LCS
- BZOJ 4990: [Usaco2017 Feb]Why Did the Cow Cross the Road II 树状数组优化LCS
- bzoj 4990: [Usaco2017 Feb]Why Did the Cow Cross the Road II
- bzoj4993 [Usaco2017 Feb]Why Did the Cow Cross the Road II
- bzoj4993: [Usaco2017 Feb]Why Did the Cow Cross the Road II
- 4990: [Usaco2017 Feb]Why Did the Cow Cross the Road II
- bzoj4996: [Usaco2017 Feb]Why Did the Cow Cross the Road II
- 大数据之Linux02
- 进程和线程的区别
- Redis的发布订阅的使用方法
- 美团点评面试题
- c++中箭头操作符(->)和点操作符(.)有什么不同
- USACO-2017-FEB-金组 Why Did the Cow Cross the Road II
- Stars POJ 2352(简单树状数组)
- 使用管道流和线程实现:控制台不断输入,并输出到文件中
- Sqlmap扩展—外部IP代理池实现
- 区间交(树状数组+二分)hdu5700
- Linux的一些基本操作以及搭建Redis集群时的一些配置和踩过的坑
- 2.1_数据类型1_赋值
- 循环嵌套性能优化
- hdu5829快速数论变换以及任意模数的拓展!!!