Hello everyone, I tried to solve this problem, but my iterative solution is not working. Basically I try to use the same logic as the problem author, but it fails on case #11. I will be thankful to you all if you can help!
My solution
Hello everyone, I tried to solve this problem, but my iterative solution is not working. Basically I try to use the same logic as the problem author, but it fails on case #11. I will be thankful to you all if you can help!
#include "bits/stdc++.h"
using namespace std;
int main(){
char arr[1000000];scanf("%s",arr);
int n=strlen(arr);
vector<long double> v;
long double p1=0.0,p2=1.0;
for(int i=0;i<n;i++){
long double k=(p1+p2)/2,d=(p2-p1)/2;
if(arr[i]=='l'){
v.push_back(k);
p1=k-d,p2=k;
}
else{
v.push_back(k);
p1=k,p2=k+d;
}
}
map<long double,int> m;
int l=v.size();
for(int i=0;i<n;i++){m[v[i]]=i+1;}
sort(v.begin(),v.end());
for(int i=0;i<l;i++){printf("%d\n",m[v[i]]);}
}
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Название |
---|