1.题目原文
You're in the middle of writing your newspaper's end-of-year economics summary, and you've decided that you want to show a number of charts to demonstrate how different stocks have performed over the course of the last year. You've already decided that you want to show the price of n different stocks, all at the same k points of the year.
A simple chart of one stock's price would draw lines between the points (0, price0), (1, price1), ... , (k-1, pricek-1), where pricei is the price of the stock at the ith point in time.
In order to save space, you have invented the concept of an overlaid chart. An overlaid chart is the combination of one or more simple charts, and shows the prices of multiple stocks (simply drawing a line for each one). In order to avoid confusion between the stocks shown in a chart, the lines in an overlaid chart may not cross or touch.
Given a list of n stocks' prices at each of k time points, determine the minimum number of overlaid charts you need to show all of the stocks' prices.
Input
The first line of input will contain a single integer T, the number of test cases. After this will follow T test cases on different lines, each of the form:
n k price0,0 price0,1 ... price0,k-1 price1,0 price1,1 ... price1,k-1 ... pricen-1,0 pricen-1,1 ... pricen-1,k-1
Where pricei,j is an integer, the price of the ith stock at time j.
Output
For each test case, a single line containing "Case #X: Y", where X is the number of the test-case (1-indexed) and Y is the minimum number of overlaid charts needed to show the prices of all of the stocks.
Limits
1 ≤ T ≤ 100
2 ≤ k ≤ 25
0 ≤ pricei,j ≤ 1000000
Small Input
1 ≤ n ≤ 16
Large Input
1 ≤ n ≤ 100
Sample
2.解题思路
3.AC代码
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
using namespace std;
#define maxk 30
#define maxn 105
#define MAX_V 205
int N,K;
int P[maxn][maxk];
//二分图匹配模板
int V;//顶点数
vector<int> G[MAX_V];//图的邻接表表示
int match[MAX_V];//所匹配的顶点
bool used[MAX_V];//DFS中用到的访问标记
//向图中增加一条连接u和v的边
void add_edge(int u,int v)
{
G[u].push_back(v);
G[v].push_back(u);
}
//通过DFS寻找增广路
bool dfs(int v)
{
used[v]=true;
for(int i=0;i<G[v].size();i++){
int u=G[v][i],w=match[u];
if(w<0||!used[w]&&dfs(w)){
match[v]=u;
match[u]=v;
return true;
}
}
return false;
}
//求解二分图的最大匹配
int bipartite_matching()
{
int res=0;
memset(match,-1,sizeof(match));
for(int v=0;v<V;v++){
if(match[v]<0){
memset(used,0,sizeof(used));
if(dfs(v)){
res++;
}
}
}
return res;
}
//二分图匹配模板
void solve()
{
V=N*2;
for(int i=0;i<V;i++){
G[i].clear();
}
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(i==j) continue;
bool ok=true;
for(int k=0;k<K;k++){
if(P[j][k]>=P[i][k]){
ok=false;
}
}
if(ok){
add_edge(i,N+j);
}
}
}
int ans=N-bipartite_matching();
printf("%d\n",ans);
}
int main()
{
freopen("C-large-practice.in","r",stdin);
freopen("C-large-practice.out","w",stdout);
int t,kase=0;
scanf("%d",&t);
while(t--){
scanf("%d%d",&N,&K);
for(int i=0;i<N;i++){
for(int k=0;k<K;k++){
scanf("%d",&P[i][k]);
}
}
printf("Case #%d: ",++kase);
solve();
}
return 0;
}