infoarena

if(q == n-i){
	if(q > l){l = q; unu = 0; doua = 1;}
		q = pi[q];
	}
if(q == n-i+1){
	if(q > l){l = q; unu = 1; doua = 0;}
		q = pi[q];
}

#include<iostream.h>
#include<fstream.h>
#include<string.h>
int main()
{char a[200001],b,c[200001];
long i,k=0;
ifstream f("palindrom.in");
ofstream g("palindrom.out");
f.getline(a,200000);
i=strlen(a)-1;
b=a[i-1];
while(i!=0)
	{if(a[i]!=b)
		i=0;
	else
		{k++;
	i--;}
	}
if(k==0)
	{strcpy(c,a);
	strcpy(a+strlen(a)-1,a+strlen(a));
strcat(c,strrev(a));
g<<c;}

else
	{strcpy(c,a);
strcpy(c+strlen(c)-k+1,c+strlen(c));
	strcpy(a+strlen(a)-k,a+strlen(a));
strcat(c,strrev(a));
g<<c;
	}

return 0;}

#include <iostream> 
#include <cstring> 
using namespace std; 
 
int main() 
{ 
  char str[] = "this is a test"; 
  char *start, *end; 
  int len; 
  char t; 
 
  cout << "Original: " << str << "\n"; 
   
  len = strlen(str); 
 
  start = str; 
  end = &str[len-1]; 
 
  while(start < end) { 
    // swap chars 
    t = *start; 
    *start = *end; 
    *end = t; 
 
    // advance pointers 
    start++; 
    end--; 
  } 
 
 
  cout << "Reversed: " << str << "\n"; 
  return 0; 
}

#include <algorithm> 
//s-sirul
n=strlen(s);
reverse( s, s+n ); //reverse actioneaza pe intervalul [ begin, last )