Search found 1 match

by bertho_coder
Sat Oct 10, 2015 7:01 pm
Forum: Volume 123 (12300-12399)
Topic: 12311 - All-Pair Farthest Points
Replies: 0
Views: 6247

Re: 12311 - All-Pair Farthest Points

Getting WA :( Don't know why. My approach was to run two sliding windows from two sides to get the smallest index of the farthest point #include<bits/stdc++.h> using namespace std; #define D(x) cout<<#x " = "<<(x)<<endl #define un(x) x.erase(unique(all(x)), x.end()) #define sf(n) scanf("%d", &n) #de...

Go to advanced search