fork(6) download
copy 
  1. /*
  2. written by- Piyush Golani
  3. language- c++
  4. country- India
  5. College- N.I.T Jamshedpur
  6. */
  7. #include <cmath>
  8. #include <ctime>
  9. #include <iostream>
  10. #include <string>
  11. #include <vector>
  12. #include<cstdio>
  13. #include<sstream>
  14. #include<algorithm>
  15. #include<cstdlib>
  16. #include<cstring>
  17. #include<map>
  18. #include<cctype>
  19. using namespace std;
  20. #define pb push_back
  21. #define all(s) s.begin(),s.end()
  22. #define f(i,a,b) for(int i=a;i<b;i++)
  23. #define F(i,a,b) for(int i=a;i>=b;i--)
  24. #define PI 3.1415926535897932384626433832795
  25. #define INF 1000000005
  26. #define BIG_INF 7000000000000000000LL
  27. #define mp make_pair
  28. #define eps 1e-9
  29. #define LL long long
  30. #define si(n) scanf("%d",&n)
  31. #define sll(n) scanf("%lld",&n)
  32. #define mod 1000000007
  33. #define MAX 5005
  34.  
  35. char A[MAX];
  36. int L[2][MAX];
  37. int n;
  38.  
  39. int ch()
  40. {
  41.     f(i,1,n+1)
  42.     {
  43.         f(j,1,n+1)
  44.         {
  45.             if(A[i-1]==A[n-j])
  46.             {
  47.                 L[i%2][j]=1+L[(i-1)%2][j-1];
  48.             }
  49.             else
  50.             {
  51.                 L[i%2][j]=max(L[(i-1)%2][j],L[i%2][j-1]);
  52.             }
  53.         }
  54.     }
  55.     return L[n%2][n];
  56. }
  57.  
  58.  
  59.  
  60. int main()
  61. {
  62.     si(n);
  63.     scanf("%s",A);
  64.     //puts(B);
  65.     printf("%d\n",n-ch());
  66.     return 0;
  67. }
  68.  
  69.  
Success #stdin #stdout 0.01s 2772KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0
https://ideone.com/0urfNu
language:
C++ (gcc 8.3)
created:
11 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!