B. Accordion

https://codeforc.es/contest/1101/problem/B

题意：左边是[:中间可以有|，右边是:]；问最长的串；

思路：先找到[:和:],再看有多少|；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}


int n;
int ans[maxn];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    string s;
    cin>>s;
    int la=-1,lb=-1,ra=-1,rb=-1;
    int n=s.length();
    for(int i=0;i<n;i++)
    {
        if(s[i]=='[')
        {
            la=i;
            break;
        }
    }
    for(int i=la+1;i<n;i++)
    {
        if(s[i]==':')
        {
            lb=i;
            break;
        }
    }

    for(int i=n-1;i>lb;i--)
    {
        if(s[i]==']')
        {
            ra=i;
            break;
        }
    }
    for(int i=ra-1;i>lb;i--)
    {
        if(s[i]==':')
        {
            rb=i;
            break;
        }
    }
    if(la==-1||lb==-1||ra==-1||rb==-1)
    {
        cout<<-1<<endl;
        return 0;
    }
    int ans=4;
    for(int i=lb+1;i<rb;i++)
    {
        if(s[i]=='|')
        {
            ans++;
        }
    }
    cout<<ans<<endl;


	return 0;
}