I use ST3 to build my cpp programs. I'm trying to find if there is a way where every time I build my program, it creates a copy of the program in some other directory, kind of like how CHelper in Java creates a final output file in one location. I want this so that I can easily submit my file on codeforces, so I don't have to locate my file every time I solve a new problem.

Hello all,

I wanted to improve my dp skill to next level and I see many problems have log N optimization that I cannot think of. Does anyone maybe have a list with such problems of DP, but with some log N optimization, for example N^2 -> NlogN or N^3 -> N^2logN. Any problems would help, preferably from Codeforces Div 2 C-E level.

Thank you!

Hello,

I am just asking if for some hard problems you take the time to create a program which can output the correct solution for any small input, though it will TLE if you submit it. Maybe it takes long to code, but it will help you in the long run?

Is timus down for anyone else? I've been checking for the past week or so but it's always been down. Specifically my link is http://acm.timus.ru

Hi all,

I've been trying to solve the classical problem of finding the perimeter of the union of a set of rectangles. Each rectangle has coordinates in [-10000, 10000] and there are N ( N <= 5000) rectangles. I've looked up solutions online, but I've had trouble finding a solid implementation, and my past ideas have all failed. I know I want to use some kind of N^2 sweep line, but I can't figure out what to do at each event. Can someone help guide me through this problem?