Cod sursa(job #613158)
Utilizator | zloteanu adrian nichita zloteanu.adrian | Data | 17 septembrie 2011 11:01:53 |
---|---|---|---|
Problema | Substr | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <cstring>
#include <fstream>
#include <algorithm>
using namespace std;
bool cmp(char* c1, char* c2)
{return strcmp(c1, c2) < 0;}
char v[16400],*p[16400];
int MM,i,N,K,R;
int main()
{ifstream q("substr.in");
ofstream w("substr.out");
q>>N>>K>>v;
for(i=0;i<N;i++)
p[i]=v+i;
sort(p,p+N,cmp);
for(i=0;i<N-K-1;i++)
{MM=0;
char *p1=p[i],*p2=p[i+K-1];
while(*p1==*p2&&*p1&&*p2){
MM++;
p1++;
p2++;}
if(MM>R)
R=MM;}
w<<R;
return 0;}