Credited with solving this puzzle:
IBM’s QRadar system keeps track of events by measuring something every second. It has an anomaly detection system that alerts the user when the current measurement is more than three standard deviations away from the average of all previous measurements.
An imaginary attacker is trying to deceive the system by slowly drifting the measurements, without violating the anomaly detection rule at any stage. If the first two authentic measurement were -100 and 100, then the second can be anywhere between -300 and 300 without triggering an alert.
The attacker can throw the measurements off quite fast. For example, the sequence {-100, 100, -300, 389, 786, 1318, -1284} is a legal sequence (every measurement is no more than three standard deviations from the average of the previous ones), spanning an interval length of 2602.
To make things more complex, we ask the question in two dimensions: where each measurement is a Gaussian integer (a complex number whose real and imaginary parts are both integers) and the attacker tries to maximize the area of the convex hull of the sequence.
Your task is to find a legal sequence of 9 measurements starting with -100i,100i that achieves a convex hull area of at least 7,700,000.
Please supply the solution in the following format: (-100,0),(100,0),(110,279), …
