Crazy Binary String

百度(1条未读通知)首页2019牛客暑期多校训练营(第三场)_ACM/noip/noil…B- Crazy Binary String_2019牛客暑期多校训练营(时间限制:CC++1秒,其他语言2秒

空间限制:CC++262144K,其他语言524288K

64bit lO Format: %lld

题目描述x

ZYB loves binary strings(strings that only contains 0'and 1). And he loves Itextit(equal binary strings) more, where the number of O' and the number of 1"in the string are equal

ZYB wants to choose a substring from an original string T so that it is an Itextitequal binary string with the longest length possible. He also wants to choose a subsequence of T which meets the

same requirements

A string v is a substring of a string w if v is empty, or there are two integers I andr(1<LSTslwl)such that v =w) wl+I. Wr. A string v is a subsequence of a string w if it can be derived from w

输入描述:

The first line of the input contains a single integer N(I<N<100000), the length of the original string T. The second line contains a binary

string with exactly N characters, the original string T

输出描述

Print two integers A and B, denoting the answer for substring and subsequence respectively

示例1

复制

For simplicity, you only need to output the maximum possible length. Note that the empty string is both a substring and a subsequence of any string

输入描述

The first line of the input contains a single integer N(1<N<100000), the length of the original string T. The second line contains a binary

string with exactly N characters, the original string T

输入

01001001

输出

4 6

#include <bits/stdc++.h>
using namespace std;struct node{int maxp,minp;
};
bool cmp(node a,node b){return a.maxp-a.minp>b.maxp-b.minp;
}int main() {int n,zero_c=0,one_c=0,dif;scanf("%d",&n);string s;cin>>s;vector<node>cc(3*n,{-1,-1});cc[n+0].minp=0;for(int i=0;i<n;i++){if(s[i]=='0')zero_c++;else if(s[i]=='1') one_c++;dif=zero_c-one_c;if(cc[n+dif].minp==-1)cc[n+dif].minp=i+1;if(cc[n+dif].maxp==-1)cc[n+dif].maxp=i+1;if(cc[n+dif].minp>i+1)cc[n+dif].minp=i+1;else if(cc[n+dif].maxp<i+1)cc[n+dif].maxp=i+1;}sort(cc.begin(), cc.end(), cmp);printf("%d %d",cc[0].maxp-cc[0].minp,2*min(zero_c,one_c));return 0;
}

Crazy Binary String相关推荐

【2019牛客暑期多校训练营（第三场）- B】Crazy Binary String（思维，01串，前缀和）
题干: 链接:https://ac.nowcoder.com/acm/contest/883/B 来源:牛客网 ZYB loves binary strings (strings that only ...
2019 牛客多校第三场 B Crazy Binary String
题目链接:https://ac.nowcoder.com/acm/contest/883/B 题目大意给定一个长度为 N 的 01 字符串,输出最长子串和子序列的长度,满足其中 0 和 1 的个数相 ...
Binary String Reconstruction CodeForces - 1352F（思维+构造）
For some binary string s (i.e. each character si is either '0' or '1'), all pairs of consecutive (ad ...
Binary String Minimizing CodeForces - 1256D（贪心）
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1'). I ...
nyoj 题目5 Binary String Matching
Binary String Matching 时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述 Given two strings A and B, whose alpha ...
Binary String Matching
Binary String Matching 描述 Given two strings A and B, whose alphabet consist only '0' and '1'. Your t ...
Binary String Constructing（CF-1003B）
Problem Description You are given three integers aa, bb and xx. Your task is to construct a binary s ...
2019牛客暑期多校训练营（第三场） B-Crazy Binary String
题目描述 ZYB喜欢二进制字符串(只包含'0'和'1'的字符串).他喜欢equal binary string(其中字符串中的"0"数和"1"数相等) ZYB想 ...
D1. Kirk and a Binary String (easy version)
题目链接:http://codeforces.com/contest/1204/problem/D1 D1. Kirk and a Binary String (easy version) time ...

Crazy Binary String

Crazy Binary String相关推荐

最新文章

热门文章