4.2 日刷题

1、黑白棋子的移动
解题思路：注意输入n的范围 <4 是无解的，我还傻傻的模拟半天。用递归求解，每个状态最终都会变成n = 4的时候的状态，然后直接输出即可

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 210;
char str[N];
int n;
bool check()
{
    for (int i = 1; i <= 4; i ++ )
    {
        if(str[i]!='o') return false;
    }
    for (int i = 1; i <= 4; i ++ )
    {
        if(str[4+i]!='*') return false;
    }
    if(str[9] != '-' && str[10]!='-') return false;
    return true;
}
void Print()
{
    string s = "";
    for (int i = 11; i <= 2*n+2; i ++ ) s+=str[i];
    
    
    cout << "oooo****--"+s<<endl;
    cout << "ooo--***o*"+s<<endl;
    cout<<"ooo*o**--*"+s<<endl;
    cout<<"o--*o**oo*"+s<<endl;
    cout<<"o*o*o*--o*"+s<<endl;
    cout<<"--o*o*o*o*"+s<<endl;
}
void fun(int i,int a,int b,int c,int d)
{
    if(check())
    {
        Print();
        return;
    }
    for (int i = 1; i <= 2*n+2; i ++ ) cout<<str[i];
    cout<<endl;
    swap(str[a],str[c]),swap(str[b],str[d]);
    if(i%2==0) c-=2,d-=2;
    else a-=1,b-=1;
    fun(i+1,a,b,c,d);
}
int main()
{
    cin>>n;
    for (int i = 1; i <= n; i ++ ) str[i] = 'o';
    for (int i = 1; i <= n; i ++ ) str[n+i] = '*';
    str[2*n+1] = str[2*n+2] = '-';
    fun(0,n,n+1,2*n+1,2*n+2);
    return 0;
    
}

2、 最长连续子序列
解题思路：经典的双指针题目，用数组记录每个序列片段，用sum记录当前子序列出现的数的个数，如果大于k，就移动左指针，直到<=k即可。

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 5e5+10,M = 1e6+10;
int a[N];
int n,k;
int st[M];
int main()
{
    cin>>n>>k;
    for (int i = 1; i <= n; i ++ ) cin>>a[i];
    int sum = 0;//表示当前序列中有多少个不同的值
    int l = 1,r;
    int ansl = 0,ansr = 0,ans = 0;
    for (r = 1; r <= n; r ++ )
    {
        int ver = a[r];
        if(st[ver] == 0) sum++;
        st[ver]++;
        if(sum > k && r-l > ans)
        {
            ansl = l,ansr = r-1,ans = r-l;
        }
        
        while(sum > k)
        {
            st[a[l]]--;
            if(st[a[l]] == 0) sum --;
            l++;
        }
    }
    if(r - l > ans)
    {
        ansl = l,ansr = r-1;
    }
    cout<<ansl<<" "<<ansr<<endl;
    return 0; 
 
}