OJ Board

I am getting WA for this problem but can't find the bug. I use 2 functions. One for the length of LIS and other to print the LIS. Don't know where am I getting it wrong. Here's the code

#include<iostream>
#include<sstream>
#include<map>
#include<vector>
#include<iomanip>
#define PB push_back
using ...

Thanx...I got AC

I am also getting WA in this problem. Here's the code.

#include<iostream>
using namespace std;
int a[20001];
int main()
{
ios_base::sync_with_stdio(false);
int t,n;
cin>>t;
for(int kase=1;kase<=t;kase++)
{
cin>>n;
for(int i=1;i<n;i++)
cin>>a[i];
int x=1,y=1,sum=0,resX=1,resY=1,res=0 ...

For g++ under cygwin follow these steps,
http://www.claremontmckenna.edu/math/ALee/g++/g++.html

I would suggest you to use mingw because cygwin doesn't support a couple of things like stringstream. I have both on my system and I mostly use mingw.

Thanx...I got AC

I am continuously getting WA in this problem. This seems to be a simple problem. I am using Floyd Warshall to find the shortest path distance and then backtracking to get the path. Can anybody help?

I had left the problem and after a few months i tried again and got Accepted in 0.00 time(14th rank) ...things change with time

i already tried clearing each variable before a new test case....but still the problem persists.....i dont think clearing variables is the problem since i am initializing new variables for every test case
n i dont know y its working fine on VC++.....i am using cygwin compiler and getting wrong n i ...

I am having a strange kind of problem...n i have no clue :roll:

if the input is

xzbcoeju
aboygp
eylfp
npljvrvi


my output is correct

34573
11
21
8782


but if i change the first input like this

xzbcoejuvp
aboygp
eylfp
npljvrvi

then my output for last value goes wrong

3225844
11 ...

helloneo wrote:I got AC with Kruskal..
But it's so slow..
9.937 sec with qsort() library in C
and 3.064 sec with my own quick sort..

i always thought stl is very efficient....can we code our own function three times efficient than stl ones???

908 is also MST problem

i m using stl sort...still getting tle....is thr any other algorithm more efficient than kruskal for this problem???

i can take care of ur case....actually i needed to chk dis at the beginning of the loop but i chked at the end

if(hw>=n-1)
break;


I m implementing Kruskal algorithm....i implemented Kruskal in the same way for 908 and 10034 and got AC in 0.00 and 0.123 repectively.......maybe this code ...

i m getting TLE for this problem...can nebody tell me how can i improve the efficiency
here is the code

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
using namespace std;
struct edges{
int v1,v2;
int w;
};
struct point{
int x,y ...

I have tried everythin but still i am getting TLE...
wat is the complexity required for this problem

First I coded using O(n2) and got TLE then i chked by submitting O(nlogk) solution from net...again I got TLE....i dont think I/O is a problem coz i have tried a lot of test cases......but still ...