Darkness 2003-11-05 15:00:00 UTC
 
Twilight 2003-11-06 15:00:00 UTC
 
Daylight 2003-11-07 15:00:00 UTC
 
Finish 2003-11-12 15:00:00 UTC

MATLAB Golf: Heaviest - Comments

Search Comments

Go

Date Submission Comment
2003-11-05 16:59:41 UTC conv Inf b3
by nikola
Sorry for that previous one...
by nikola
2003-11-05 16:58:48 UTC conv Inf b2
by nikola
[m n b]=size(a);
for i=2:n
for j=1:max(a(:))
c=a;
c(a~=j)=-Inf;
b=max([b;max(max(conv2(c,ones(i),'valid')))]);
end;
end
by nikola
2003-11-05 16:57:46 UTC generally
by ravi
considers all possible submatrices
by ravi
2003-11-05 16:57:35 UTC faster test
by AJ
This should work with a weak test suite.
by AJ
2003-11-05 16:56:46 UTC test99
by Alex
-
by Alex
2003-11-05 16:54:46 UTC Hairy/Fierce
by GreatRumpuscat
these aren't technically correct, so we will see!
by GreatRumpuscat
2003-11-05 16:54:43 UTC initb
by PU
Init b...
by PU
2003-11-05 16:54:24 UTC FDA disapp3
by jsl
probably not better, but more correct
by jsl
2003-11-05 16:50:37 UTC Uuo1
by Tim Lewis
trying to cheat...
by Tim Lewis
2003-11-05 16:47:18 UTC Bob10
by Tristram Scott
Last guess...
by Tristram Scott
2003-11-05 16:47:03 UTC test32
by Alex
-
by Alex
2003-11-05 16:46:31 UTC Bob9
by Tristram Scott
Another guess at required size...
by Tristram Scott
2003-11-05 16:45:18 UTC test97
by Alex
-
by Alex
2003-11-05 16:45:12 UTC Bob8
by Tristram Scott
Bit smaller, maybe faster...
by Tristram Scott
2003-11-05 16:44:07 UTC Risky trick
by Erick Wong
Hope this doesn't use stats toolbox...
by Erick Wong
2003-11-05 16:42:54 UTC test_14
by Stijn Helsen
oepsoeps
by Stijn Helsen
2003-11-05 16:42:06 UTC test_13
by Stijn Helsen
oeps
by Stijn Helsen
2003-11-05 16:40:35 UTC Lucky
by Paulo Uribe
works if test case is just right...
by Paulo Uribe
2003-11-05 16:39:39 UTC FDA12.6
by François Glineur
Max is too long
by François Glineur
2003-11-05 16:35:53 UTC FDA failed this one
by jsl
better than statistics!
by jsl
2003-11-05 16:34:43 UTC test96
by Alex
-
by Alex
2003-11-05 16:34:03 UTC defghi
by a
j
by a
2003-11-05 16:33:28 UTC peng12
by peng
sorry
by peng
2003-11-05 16:33:01 UTC test95
by Alex
-
by Alex
2003-11-05 16:32:53 UTC pp11
by peng
[m n b]=size(a);
for i=1:m
for j=1:m-i
for k=1:n-j
c = a(i:j+i,k:k+j);
s = sum(c(:));
if ~std(c) & s > b
b = s;
end
end
end
end

by peng