OJ Board

Clay Young from Santa Clara was looking for GREEK TRADITIONS

Carlton Doyle found the answer to a search query GREEK TRADITIONS




GREEK TRADITIONS



http://essayerudite.com/images/banner/500x500.jpg


























best analysis essay ...

Clyde Webb from Washington was looking for essays on social systems

Sherman Jenkins found the answer to a search query essays on social systems




essays on social systems



http://essayerudite.com/images/banner/500x500.jpg


























books ...

Jerry Cunningham from Redding was looking for dissertation topics on accounting and finance

Kameron Day found the answer to a search query dissertation topics on accounting and finance



dissertation topics on accounting and finance



http://essayerudite.com/images/banner/500x500.jpg ...

Trae Peters from Vallejo was looking for midnight in the garden of good

Fernando Hawkins found the answer to a search query midnight in the garden of good




midnight in the garden of good



http://essayerudite.com/images/banner/500x500.jpg ...

Emanuel Riley from Alameda was looking for by essay housman i one twenty when

Andy Berry found the answer to a search query by essay housman i one twenty when



http://essayerudite.com/images/banner/500x500.jpg


write my essay










one page essay writing hours
table of ...

Akeem Byrne from Dallas was looking for how to write the best college admissions essay level 4

Ulises Atkinson found the answer to a search query how to write the best college admissions essay level 4




how to write the best college admissions essay level 4



http://essayerudite.com ...

lighted wrote: Sat Jul 22, 2017 8:43 pm Number of buildings N is at most 1121.

So you did binary search on the size of array!!!

suneast wrote: Thu May 20, 2010 4:38 pm u can just asume that N is not larger than 10000
I solved this PRO use O(N^2) BRUTE FORCE...

Mukit Chowdhury wrote: Wed Mar 13, 2013 5:50 pm In this problem array of 1500 elements is enough... no need to check negative number ... My algo is of O(n*n) and Accepted in 0.068 second...

Number of buildings N is at most 1121.

Passes all input data provided by Brian Fry, but still WA!
#include <bits/stdc++.h>
using namespace std;

int n, ans[2000];

int main()
{
int test, t=0;

// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);

scanf("%d", &test);
while (test--)
{
scanf("%d", &n);

vector ...

Input: 100
6
5 8 4 5 6 4
5 9 7 8 4 6
6
1 3 10 7 7 3
7 3 9 4 7 3
3
7 1 8
3 8 1
4
1 9 4 8
6 9 5 3
1
4
4
10
10 10 4 10 2 5 1 6 6 10
5 9 1 5 2 4 4 6 3 2
9
10 7 5 6 4 9 6 8 7
10 10 2 3 1 10 3 4 6
3
8 10 2
9 6 6
6
3 7 5 9 9 6
1 7 8 2 2 2
5
6 2 4 5 9
4 2 1 4 2
2
6 1
8 10
4
10 4 6 3
5 1 3 6
9
8 9 8 3 3 1 6 ...

In this problem array of 1500 elements is enough... no need to check negative number ... My algo is of O(n*n) and Accepted in 0.068 second...

Oh, thats the catch
That was confusing becouse in problem there werent bounds for n.
thank you alot and sorry that i created new post

Next time use the existing thread:
http://acm.uva.es/board/viewtopic.php?t=50432

In there you can see that the number of buildings might be up to 10000. You only allocate space for 100.

I saw somewhere, this was just a try.
with return 0 is also RTE.

Why did you comment out return 0 at the end?