Search found 1 match

by littleibex
Sat Dec 17, 2011 7:54 pm
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 56559

Re: 10000 - Longest Path

Hi..I am getting TLE...can anybody help me out please..here is my code

#include <iostream>
#include <sstream>

using namespace std;

int max1, max2, pl;
bool map[110][110];

void go(int s, int n)
{
for(int j = 1; j <= n; j ++)
{
if(map[s][j])
{
max2 ++;
go(j, n);
}
}
if(max2 > max1 ...

Go to advanced search