Jessicas Reading Problem

Jessicas Reading Problem_第1张图片

选择长度最小的子段,使得包含所有出现的元素 

//#pragma GCC optimize(2)
//#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define rush() int T;cin>>T;while(T--)
#define ms(a,b) memset(a,b,sizeof a)
#define E 1e-8
#define sd(a) scanf("%d",&a)
#define pd(a) printf("%d\n",a)
#define debug(a) cout<<"*"< Pair;
const int inf=0x7f7f7f7f;
const int mod=100003;
const int N=1e6+5;

    int n,m,t;
    int i,j,k;
    int a[N];
    set s;
    map mp;

int main()
{
    //IOS;
    while(~sd(n)){
        for(i=0;i

 

你可能感兴趣的:(#,尺取法,POJ)