Editing 2015 Dec Bronze Problem 3 Contaminated Milk (section)

== Solution ==

The problem can be solved with a straightforward simulation approach.

We can simulate the process in the following steps:

* For each milk producer, we can iterate through each time unit and each cow. If the cow drank milk from that producer at that time, and if the cow gets sick at a later time exactly P units away, then we suspect that this milk producer might be the one that produced the contaminated milk.
* For each suspected milk producer, we can check if every cow who drank milk from this producer got sick exactly P units after drinking the milk. If so, we confirm this milk producer as a culprit.
* Finally, we output the maximum number of cows that got sick from drinking the milk of a confirmed milk producer.

This approach will find all the possible milk producers that may have caused the sickness and count the maximum number of cows that could have been infected by each of these producers. The solution runs in a reasonable time since the inputs are relatively small.

The key part of this solution is careful implementation: we must keep track of when each cow drank milk from each producer, and when each cow got sick. This can be done with simple array or list structures, with the indices representing the cows or milk producers, and the values representing the times.