【算法】Sky Map
来源:互联网 发布:ubuntu ftp服务器搭建 编辑:程序博客网 时间:2024/05/28 14:57
问题描述:
You are making “sky map” to represent constellation (group of starts) in the sky.
In each element, 1 means star, 0 means empty.
And in a constellation, each start should have at least one connection with others via left/right/up/bottom.
If two starts are located via diagonal, then
the two stars are not connected (belong to different constellation.)
How many constellations are in your sky map, and what is the number of starts in the greatest constellation?
[Input]
There can be more than one test case in the input.
The first line has T, the number of test cases.
Then the totally T test cases are provided in the following lines (T<=10)
In each test case, the first line has an integer N(5 ≤ N ≤ 25), the size of map.
The map is a square, and is represented as N x N matrix.
For next N lines, each contains each raw of the matrix
[Output]
For each test case, you should print the number of constellation and the number of starts in the greatest constellation separated by blank.
[I/O Example]
Input
2
7
0 1 1 0 0 0 0
0 1 1 0 1 0 0
1 1 1 0 1 0 1
0 0 0 0 1 1 1
1 0 0 0 0 0 0
0 1 1 1 1 1 0
0 1 0 1 1 0 0
5
0 1 0 0 0
0 1 0 0 0
0 1 0 0 0
0 0 0 0 0
0 0 0 0 0
Output
4 8
1 3
分析:
寻找矩阵中所有包含1的块数,及1的最大个数
源码:
#include <iostream>using namespace std;int N;int data[26][26];int look(int vpos, int hpos){int sum = 0;if (data[vpos][hpos] == 1){sum++;data[vpos][hpos] = 0;if (hpos<N)sum += look(vpos, hpos + 1);if (vpos<N)sum += look(vpos + 1, hpos);if (hpos>1)sum += look(vpos, hpos - 1);if (vpos>1)sum += look(vpos - 1, hpos);}return sum;}int main(int argc, char** argv){int test_case;int T;int temp;/*The freopen function below opens input.txt file in read only mode, and afterward,the program will read from input.txt file instead of standard(keyboard) input.To test your program, you may save input data in input.txt file,and use freopen function to read from the file when using cin function.You may remove the comment symbols(//) in the below statement and use it.Use #include<cstdio> or #include<stdio.h> to use the function in your program.But before submission, you must remove the freopen function or rewrite comment symbols(//).*/// freopen("input.txt", "r", stdin);cin >> T;for (test_case = 0; test_case < T; test_case++){int i, j;int S, C;cin >> N;for (i = 1; i <= N; i++) {for (j = 1; j <= N; j++){cin >> data[i][j];}}/*********************************** Implement your algorithm here. ***********************************/S = 0;C = 0;for (i = 1; i <= N; i++){for (j = 1; j <= N; j++){temp = look(i, j);if (temp > 0)S++;if (temp > C)C = temp;}}// Print the answer to standard output(screen).cout << S << " " << C << endl;}return 0;//Your program should return 0 on normal termination.}
- 【算法】Sky Map
- Sky Map
- Sky Map
- SKY
- sky
- sky
- sky
- 算法Map
- Sad Sky
- Google Sky
- shader Sky
- sky mobi
- sky数
- sky 数
- Sky数
- Sky数
- Sky数
- Sky数
- 数据挖掘学习路线
- Deck
- Android之ExpandableListView的属性(Group不展开)
- [置顶] VS2010中文注释带红色下划线的解决方法
- 系统日志Logrotate配置
- 【算法】Sky Map
- HDU 5416(思路题目)
- C++ map的基本操作和使用
- Hadoop简介(分布式系统基础架构)
- HDU 4746 Mophues (莫比乌斯反演应用)
- iOS中使用storyboard实现页面跳转,Segue详解及简单的数据传递
- UVA 10815 Andy's First Dictionary
- 设置元素的属性attr 和setAttribute
- 开源平台选型建议