oh.. help me...
Search found 2 matches
- Tue Apr 07, 2009 3:52 am
- Forum: Volume 114 (11400-11499)
- Topic: 11475 - Extend to Palindrome
- Replies: 32
- Views: 20519
Re: 11475 - Extend to Palindromes
yes, it works very fast, but it was TLE again when i submitted...
oh.. help me...
oh.. help me...
- Thu Feb 05, 2009 5:48 pm
- Forum: Volume 114 (11400-11499)
- Topic: 11475 - Extend to Palindrome
- Replies: 32
- Views: 20519
Re: 11475 - Extend to Palindromes
Anybody can help me?
I've use the KMP and I'm sure that my program run on the largest testcases. And it works.. but I have a TLE on my code. #include<iostream>
#include<stack>
using namespace std;
char text[100001], pat[100001];
int f[100001];
stack<char> tempS;
bool isPalindrome(char* T)
{
int ...
I've use the KMP and I'm sure that my program run on the largest testcases. And it works.. but I have a TLE on my code. #include<iostream>
#include<stack>
using namespace std;
char text[100001], pat[100001];
int f[100001];
stack<char> tempS;
bool isPalindrome(char* T)
{
int ...