#include <iostream>
using namespace std;
int n, m;
int a[100][100];
int main()
{
int max, ma;
int count = 0;
cin >> n >> m;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
cin >> a[i][j];
}
for (int j = 0; j < n; j++)
{
max = 0;
count = 0, ma = 0;
int sign = 0;
for (int i = 0; i < m; i++)
{
if (a[j][i] == 1)
{
count++;
sign = 1;
if (a[j][i + 1] == 0)
{
if (count > max)
{
ma = i;
max = count;
count = 0;
}
}
}
}
if (sign)
printf("%d %d\n", ma - max + 1, ma);
else printf("-1 -1\n");
}
system("pause");
return 0;
}
查找连续最长的1
最新推荐文章于 2022-06-23 20:35:47 发布