CF 3D Least Cost Bracket Sequence
来源:互联网 发布:淘宝上怎么找人帮代卖 编辑:程序博客网 时间:2024/06/01 11:43
怎么也想不出那些大牛一样的思路啊~难道是我自己没有仔细想的缘故!?
贪心~ (其实贪心就是对“状态”而言的,以前都想错了~以为就是简单地对现阶段来贪心,其实只要总的状态得到贪心的话,要记录以前的阶段来比较)
匹配括号,? 一开始设定为 ) 然后去判断是否有括号未配对,如果有的话,就贪心一个最小的阶段。当然这个要用一个容器来记录,当然首选优先队列。很好的题~
#include <iostream>#include <queue>using namespace std;struct B{ int p,id;};priority_queue<B> q;bool operator < (const B &a,const B &b){ return a.p < b.p;}int main(){ string s; long long a,b,l,len,cost,i; B tmp; cin>>s; l = 0; len = s.size(); cost = 0 ; for(i = 0;i < len;i ++) { if(s[i] == '(') l ++; else if(s[i] == ')') l --; else { cin>>a>>b; //B tmp; tmp.p = b - a;tmp.id = i; q.push(tmp); s[i] = ')'; l --; cost += b; } if(l < 0) { if(q.empty()) break; tmp = q.top(); q.pop(); cost -= tmp.p; s[tmp.id] = '('; l +=2; } } if(l !=0) cout<<-1<<endl; else { cout<<cost<<endl; cout<<s<<endl; } while(!q.empty()) q.pop();}
- CF 3D Least Cost Bracket Sequence
- CF 3D Least Cost Bracket Sequence
- CodeForces 3D Least Cost Bracket Sequence
- codeforces 3D Least Cost Bracket Sequence
- Codeforces 3D. Least Cost Bracket Sequence
- CodeForces 3D. Least Cost Bracket Sequence
- CodeForces 3D-Least Cost Bracket Sequence
- CodeForces 3D Least Cost Bracket Sequence
- Codeforces 3D Least Cost Bracket Sequence
- D. Least Cost Bracket Sequence
- Codeforces 3D Least Cost Bracket Sequence 贪心
- Codeforces 3D Least Cost Bracket Sequence (贪心)
- Codeforces 3D Least Cost Bracket Sequence --- 贪心
- Codeforces Beta Round #3 D. Least Cost Bracket Sequence
- codeforce 3D. Least Cost Bracket Sequence(贪心)
- Codeforces 3D Least Cost Bracket Sequence [贪心]
- Codeforces 3D Least Cost Bracket Sequence(贪心)
- Codeforces Beta Round #3 D. Least Cost Bracket Sequence
- 理解ASM File Alias
- 使用phpExcel实现Excel数据的导入导出(完全步骤)
- html5 视频学习笔记。。。
- C#时间格式大全
- 修改项目路径
- CF 3D Least Cost Bracket Sequence
- 在一个上市外包企业面试经历~
- 下一代BlackBerry 10应用软件开发技术
- Object convert to Json string
- ,,
- EPD中已自带Mingw,如何安装c++ boost库?
- 推荐开发人员看的具有影响力的书籍
- tmp
- 职业规划思路