【贪心+读题】Manthan 2011 A. Partial Teacher
来源:互联网 发布:安徽农村高考知乎 编辑:程序博客网 时间:2024/06/04 23:34
偏心的老师:
每个LR=分别代表了这个同学比左边那只同学考的低/比右边那只同学考的低/和左边那只相等,考得好的糖多,考的不好的糖少,问最少给糖方案
我之前一直理解错题意了Q^Q,我以为是L就减一就好,R加一就好,然后最后一起变成正数,(刚刚去查题意还看到一个歧义的解释是 “L代表左边的人比自己高,R表示右边的高,=表示左右相等”,这个解释的话如果改成“与左边的孩纸相比,。。。”就对了)错误代码如下:
#include <cstdio>#include <string>#include <cstring> #include <iostream>#define MP(c,g) make_pair(c,g) using namespace std;int dp[1005]={0};int main(){int n, min=1;scanf("%d",&n);char c;scanf("%c",&c);memset(dp,0,sizeof dp);dp[0]=1;for(int i=1;i<n;i++){scanf("%c",&c);if(c=='=') dp[i]=dp[i-1];else if(c=='L') dp[i]=dp[i-1]-1;else if(c=='R') dp[i]=dp[i-1]+1;if(dp[i]<min) min=dp[i];}for(int i=0;i<n;i++){printf("%d",dp[i]-min+1);if(i<n-1)printf(" ");}return 0;}
实际上是怎么个意思呢,这么跟你们讲应该就懂了^_^
9
RRRRRRLL
我们是不是会以为是123456765呀?不不不,最少应该是123456721,这样分糖最少~ 是否大概理解了呢^_^,分糖什么的【要最少】
Code:
#include <queue>#include <cmath> #include <cctype>#include <cstdio>#include <string>#include <cstdlib>#include <cstring>#include <iostream>#include <algorithm>using namespace std;queue <int> q;int main(){ while(!q.empty()) q.pop(); int n; string s; cin>>n; cin>>s; for(int c=0;c<n;c++) { int i=c-1,j=c; int l=1,r=1; while(s[i]!='L'&&i>=0)if(s[i]=='R') l++,i--;else i--; while(s[j]!='R'&&j<n) if(s[j]=='L') r++,j++; else j++; q.push(max(r,l)); } while(q.size()!=1) { printf("%d ",q.front()); q.pop(); } printf("%d\n",q.front()); return 0;}
0 0
- 【贪心+读题】Manthan 2011 A. Partial Teacher
- Manthan 2011 A. Partial Teacher 拓扑排序or直接数组处理
- codeforces 67A Partial Teacher 贪心
- codeforces 67A Partial Teacher( 贪心)
- Partial Teacher 67A
- Codeforces 67A. Partial Teacher
- Codeforces 67A Partial Teacher(模拟)
- Codeforces 67A Partial Teacher【dp】
- manthan A
- Manthan, Codefest 16 -A Ebony and Ivory
- Manthan, Codefest 16 -B. A Trivial Problem
- Manthan, Codefest 16(A)暴力
- What Makes a Good Teacher?
- What Makes a Good Teacher?
- 高数 A different teacher
- A teacher in my eyes
- Benefits of Becoming a Teacher
- Manthan 2011, problem: (D) Optical Experiment mark
- 烦躁而无奈的一次调试-记fpga驱动ad9854
- [windows C/C++]面试准备(一)字符串类面试题2
- Scipy教程 - python数值计算库
- 了解hbase(二)
- Foxmail新建文件夹失败
- 【贪心+读题】Manthan 2011 A. Partial Teacher
- hbase表的设计
- OpenStack环境部署学习笔记——配置基本环境
- 托盘图标结构体TBBUTTON和TRAYDATA相关说明文章记录
- 在windows下安装Scrapy,并简单抓取网页
- iOS中assign、copy 、retain等关键字的含义
- Emacs的Tab键
- git常用命令
- 操作系统篇