Description
给出若干三角形正方形和圆形摆成一排,求它们构成的凸型的周长,三角形正方形边长和圆的直径均为单位长度
Input
第一行一个整数n表示图形的个数,之后一个长度为n的字符串表示每个图形是什么,T表示三角形,S表示正方形,C表示圆(1<=n<=20)
Output
输出构成的凸型的周长
Sample Input
4
TSTC
Sample Output
9.088434417
Solution
分几种情况考虑:
1.两边都是S
2.两边都是C
3.一边是S一边是C
4.两边都是T
5.一边是T一边是C
6.一边是T一边是S
两个麻烦的地方:
1.TT…TC(代码中的get1)
2.TT…TS(代码中的get2)
Code
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
const double PI=acos(-1.0);
const double C=0.5*sqrt(3.0);
#define maxn 22
char s[maxn];
double get1(int n)
{
double a=atan((C-0.5)/n);
double b=asin(0.5/sqrt(n*n+(C-0.5)*(C-0.5)))-a;
double c=0.5*PI-a-b;
return n+1.5+0.5*(tan(c)+b);
}
double get2(int n)
{
return n+2+sqrt((n-0.5)*(n-0.5)+(1.0-C)*(1.0-C));
}
int main()
{
int n;
while(~scanf("%d",&n))
{
scanf("%s",s+1);
double ans=0;
if(n==1)
{
if(s[1]=='T')ans=3;
else if(s[1]=='S')ans=4;
else ans=PI;
}
else
{
if(s[n]=='T')
{
for(int i=1,j=n;i<j;i++,j--)swap(s[i],s[j]);
}
if(s[1]=='S'&&s[n]=='S')ans=2*(n+1);
else if(s[1]=='C'&&s[n]=='C')ans=2*n-2+PI;
else if(s[1]=='C'&&s[n]=='S'||s[1]=='S'&&s[n]=='C')ans=2*n+0.5*PI;
else if(s[1]=='T'&&s[n]=='T')
{
int pos1=1,pos2=n;
while(s[pos1]=='T')pos1++;
while(s[pos2]=='T')pos2--;
if(pos2==0)ans=2*n+1;
else
{
if(s[pos2]=='C')ans+=get1(n-pos2);
else ans+=get2(n-pos2);
if(s[pos1]=='C')ans+=get1(pos1-1);
else ans+=get2(pos1-1);
ans+=2.0*(pos2-pos1);
}
}
else
{
int pos=1;
while(s[pos]=='T')pos++;
if(s[pos]=='C')ans+=get1(pos-1);
else ans+=get2(pos-1);
if(s[n]=='C')ans+=2*(n-pos)+0.5*PI;
else ans+=2*(n-pos)+2;
}
}
printf("%.10f\n",ans);
}
return 0;
}