SRM 439 SquareOfDigits
2009-05-11 14:44
831 查看
题目链接:http://www.topcoder.com/stat?c=problem_statement&pm=10395&rd=13747
这个题目比较简单,主要是看循环循序不同对算法效率的影响
one:
two:
这个题目比较简单,主要是看循环循序不同对算法效率的影响
one:
#include<string> #include<vector> using namespace std; struct SquareOfDigits { int min(int a,int b) { return a<b?a:b; } int getMax(vector<string> data) { int i,j,k; int size=min(data.size(),data[0].size()); for(k=size;k>1;k--) { for(i=0;i+k-1<data.size();i++) for (j=0;j+k-1<data[i].size();j++) { if(data[i][j]==data[i+k-1][j+k-1]&&data[i][j]==data[i+k-1][j]&&data[i][j]==data[i][j+k-1]) return k*k; } } return 1; } };
two:
#include<string> #include<vector> #include<iostream> using namespace std; struct SquareOfDigits { int min(int a,int b) { return a<b?a:b; } int getMax(vector<string> data) { int size = min(data.size(),data[0].size()); int ans = 1; for(int i=0;i<data.size();i++) for(int j=0;j<data[i].size();j++) { for(int len=min(data.size()-i,data[i].size()-j);len>ans;len--) { if(data[i][j]==data[i+len-1][j+len-1]&&data[i][j]==data[i+len-1][j]&&data[i][j]==data[i][j+len-1]) {ans=len;break;} } } return ans*ans; } };
相关文章推荐
- Codeforces 612 E Square Root of Permutation
- codeforces—— 770B —— Maximize Sum of Digits
- URAL1658 Sum of Digits(DP)
- 【POJ】3720 Occurrence of Digits
- [CF]Sums of Digits
- LA 6856 Circle of digits 解题报告
- Topcoder SRM 497 DIV2 1000 MakeSquare
- Light OJ:1045 Digits of Factorial(数学+思维+对数)
- codeforces 289 C Sums of Digits
- Codeforces Round #289 (Div. 2, ACM ICPC Rules)C. Sums of Digits
- Codeforces Round #277.5 (Div. 2)C. Given Length and Sum of Digits...(贪心)
- Codeforces 612E - Square Root of Permutation (置换+构造)
- leetcode-T7 Reverse digits of an integer
- Solutions to place plus or minus signs to a non-zero digits sequence 123456789 so that result of thus described arithmetic opera
- UVA - 993 Product of digits
- POJ 3720 Occurrence of Digits 可能会
- uva 993 - Product of digits
- 【C++】Reverse digits of an integer
- Ural 1658 Sum of Digits
- Reverse digits of an integer.