Codeforces 5C. Longest Regular Bracket Sequence
来源:互联网 发布:amd cpu优化 编辑:程序博客网 时间:2024/05/17 01:22
题意:求最长的有效括号序列长度
方法: 使用一个栈辅助匹配, 每次匹配成功一个记录‘)’对应的长度
代码:
#include <stdio.h>#include <string>#include <iostream>using namespace std;const int MAXN = 1000005;int num[MAXN], leftBracket[MAXN];int main(){#ifdef _LOCAL freopen("F://input.txt", "r", stdin);#endif string str; cin >> str; int count = 0, max = 0, times = 1; for(int i = 0; i < str.size(); ++i) { if(str[i] == '(') leftBracket[++count] = i; else if(count) { int pairLeft = leftBracket[count]; num[i] = i - pairLeft + 1 + num[pairLeft - 1]; --count; if(num[i] == max) { ++times; } else if(num[i] > max) { max = num[i]; times = 1; } } } printf("%d %d\n", max, times); return 0;}
0 0
- Codeforces 5C. Longest Regular Bracket Sequence
- codeforces 5C Longest Regular Bracket Sequence
- CodeForces 5C. Longest Regular Bracket Sequence
- CodeForces 5C - Longest Regular Bracket Sequence
- CodeForces 5C Longest Regular Bracket Sequence
- codeforces 5C C. Longest Regular Bracket Sequence(dp)
- Codeforces 5C Longest Regular Bracket Sequence dp+stack
- codeforces 5C Longest Regular Bracket Sequence -- 贪心
- Review of Codeforces 5C. Longest Regular Bracket Sequence
- Codeforces Beta Round #5 C. Longest Regular Bracket Sequence
- Codeforces 5C Longest Regular Bracket Sequence [贪心] [DP]
- 【CodeForces 5C】【贪心】【dp】Longest Regular Bracket Sequence
- Codeforces 5C Longest Regular Bracket Sequence 题解
- CF 5C Longest Regular Bracket Sequence
- CF 5 C. Longest Regular Bracket Sequence
- codeforce 5C Longest Regular Bracket Sequence
- 5C-codeforce Longest Regular Bracket Sequence
- C - Longest Regular Bracket Sequence
- C语言基础语法
- 关于多系统的双硬盘的系统安装
- 黑马程序员--UI学习之用代码向你展示视图控制器(UIViewController)和导航控制器(UINavigationController)配合单例的使用
- C++文件读写详解(ofstream,ifstream,fstream)
- Windows环境下搭建HBase源码开发环境
- Codeforces 5C. Longest Regular Bracket Sequence
- jQueryEasyUI Messager基本使用
- ionic写helloworld步骤
- 重建回滚表空间
- C语言实现一个单链表
- web会话管理基础
- Unity 协同处理
- win 8 常用快捷键总结
- VI/VIM常用命令