SSLOJ·字符串展开【模拟】

Description–

---

解题思路–

其实这题还是有点坑的，什么开头是’ - '、一个‘ - ’前又是一个‘ - ’ ······

---

代码–

#include<iostream>
#include<string>
#include<cstdio>
using namespace std;
string s;
int p1,p2,p3;
int main()
{
	scanf("%d%d%d",&p1,&p2,&p3);
	cin>>s;
	for (int i=0;i<s.size();++i)
	{
		if (s[i]=='-')
		{
			if (i==0 || (s[i-1]>=96 && s[i+1]<96) || (s[i+1]>=96 && s[i-1]<96) || s[i-1]>=s[i+1] || s[i-1]=='-')
			  printf("-");
	        else
	        {
	        	if (p3==1)
	        	  for (int j=int(s[i-1])+1;j<int(s[i+1]);++j)
		    	  {
		    		  if (p1==1 || (p1==2 && int(s[i-1])<96))
		    		    for (int k=1;k<=p2;++k)
		    		      printf("%c",char(j));
		    		  if (p1==2 && int(s[i-1])>=96)
		    		    for (int k=1;k<=p2;++k)
		    			  printf("%c",char(j-32));
		    		  if (p1==3)
	    		   	    for (int k=1;k<=p2;++k)
	    		    	  printf("*");
	    	      }
	    	    else
	    	      for (int j=int(s[i+1])-1;j>int(s[i-1]);--j)
		    	  {
		    		  if (p1==1 || (p1==2 && int(s[i-1])<96))
		    		    for (int k=1;k<=p2;++k)
		    		      printf("%c",char(j));
		    		  if (p1==2 && int(s[i-1])>=96)
		    		    for (int k=1;k<=p2;++k)
		    			  printf("%c",char(j-32));
		    		  if (p1==3)
	    		   	    for (int k=1;k<=p2;++k)
	    		    	  printf("*");
	    	      }
	        }
		    
		}
		else printf("%c",s[i]);
	}
		
	
	return 0;
}