Submission #1000062

---

Source Code Expand

//============================================================================
// Author       : Sun YaoFeng
//============================================================================

//#pragma 	comment(linker, "/STACK:100240000,100240000")
//#include	<cstdio>
//#include	<cstdlib>
//#include	<cstring>
//#include	<algorithm>

#include	<bits/stdc++.h>

using	namespace	std;

#define DB		double
#define	lf		else if
#define I64		long long
#define	Rd()	(rand()<<15|rand())
#define For(i,a,b)	for(int i=a,lim=b;i<=lim;i++)
#define Rep(i,a,b)	for(int i=a,lim=b;i>=lim;i--)

#define	fi	first
#define se	second
#define MK	make_pair
#define PA	pair<int, int>

//#define	min(a,b)	((a)<(b)?(a):(b))
//#define	max(a,b)	((a)<(b)?(b):(a))

#define	CH	(ch=getchar())
int		IN()	{
		int x= 0, f= 0, ch;
		for	(; CH < '0' || ch > '9';)	f= (ch == '-');
		for	(; ch >= '0' && ch <= '9'; CH)	x= x*10 + ch -'0';
		return	f? -x : x;
}

#define n	1000005

int		N, pre[n], Q[n];

char	A[n], B[n];

int		main(int argc, char* argv[]){
		N= IN();
		scanf("%s%s", A+1, B+1);
		
		int flag= 0;
		For(i, 1, N)	if	(A[i] != B[i])	flag= 1;
		if	(! flag)	return	puts("0"), 0;
		
		for (int i= N, j= N; i; i--)	{
			j= min(j, i);
			for (; j && A[j] != B[i]; j--);
			if	(! j)	return	puts("-1"), 0;
			pre[i]= j;
		}
		
		int	Ans= 1, l= 1, r= 0;
		Rep(i, N, 1)	if	(pre[i] > pre[i-1])	{
			for (; l <= r && Q[l] - (r-l) > i; l++);
			if	(pre[i] < i)	Q[++ r]= pre[i], Ans= max(Ans, r-l+2);
		}
		printf("%d\n", Ans);
		
		return	0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main(int, char**)’:
./Main.cpp:46:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s%s", A+1, B+1);
                          ^

Judge Result