OpenCV

最新推荐文章于 2023-06-23 17:43:30 发布

Flaygo

最新推荐文章于 2023-06-23 17:43:30 发布

阅读量605

点赞数

分类专栏：解题

本文链接：https://blog.csdn.net/daoqin121/article/details/39321751

版权

解题专栏收录该内容

146 篇文章 5 订阅

订阅专栏

OpenCV

Time Limit: 1000MS	Memory Limit: 65535KB
Submissions: 151	Accepted: 35

Description

OpenCV (Open Source Computer Vision) is a library of programming functions for real time computer vision. OpenCV is released under a BSD license, it is free for both academic and commercial use. Example applications of the OpenCV library are Human-Computer Interaction (HCI); Object Identification, Segmentation and Recognition; Face Recognition; Gesture Recognition; Camera and Motion Tracking, Ego Motion, Motion Understanding; Structure From Motion (SFM); Stereo and Multi-Camera Calibration and Depth Computation; Mobile Robotics. Recently ,Phillip has learnt about how to use OpenCV to solve some image problems. Doctor Jiang wants him find the moving items from the given video files. Since using OpenCV can easily deal with such problems, Phillip wants to use his own code to make it out. As we kwon images are saved as a lot of pixels in the computer. The algorithm that Phillip use is below: First, we find the different pixels between current image and the previous one image(in this problem we only care the different pixels) . Second, we record the maximum different number .

Input

The first line are two integers r (row)and c(column) which describe the size of one image. (1 < r, c < 200 ); The second Line is n which is the total number of images (1 < n < 100) Then n*r lines follow, each line contain exactly c numbers which are pixels of the image in the range of 0 to 255.

Output

One line with the maximum differenct number you have found.

Sample Input

4 4
3
255 0 0 255
223 221 220 190
10 11 12 13
0 0 0 0
255 1 1 255
245 221 220 100
11 11 0 13
1 1 1 1
255 0 0 255
245 221 220 100
11 11 0 13
1 1 1 1

Sample Output

#include<iostream>
using namespace std;
int main()
{
int n,m,z,i,j,k,l,a[256],b[100],num,t;
cin>>n>>m;
cin>>z;
for(i=0;i<z;i++)
{
  num=0;
    for(l=0;l<=256;l++)
     a[l]=0;
   for(j=0;j<m*n;j++)
   {
     cin>>t;
        a[t]++;
   }
   for(k=0;k<=256;k++)
    num+=a[k]!=0;
    b[i]=num;
}
int max=b[0];
for(i=1;i<z;i++)
  if(b[i]>=max)
   max=b[i];
cout<<max<<endl;
}