Search found 4 matches

by Phob028
Thu Feb 07, 2008 8:24 am
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 51819

Accepted :D
I thank you a lot, and you have teached me something (I didnt knew this notation (m&&n)?1:2;)
by Phob028
Thu Feb 07, 2008 12:26 am
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 51819

Yeah, it works for the sample input, thanks !
I've found an other small mistake in my conditions :

Code: Select all

done
but always got WA and I don't find an input that don't work :s
by Phob028
Wed Feb 06, 2008 10:43 am
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 51819

Thanks for your answer, next time I will post in the related topic ;)

I think these parts are useless for finding the mistake(s), but that's my program :

Code: Select all

done
The output with your correction is 1881017956. It was 9 before. It has to be 15 (with the sample output)
by Phob028
Tue Feb 05, 2008 9:11 pm
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 51819

108, am I on wrong way ?

Hi,

I'm trying to solve the problem in C++
Tab is the input array, Tab2 [j] is the sum from 0 to i and 0 to j in Tab

done

I can't assure at all wether this line : tmp=Tab2[m][n]-Tab2[m][j-1]-Tab2[i-1][n]+Tab2[i-1][j-1]; is correct or not, maybe it has to be checked first :-?

PS : Here is only ...

Go to advanced search