PAT_(其他技巧-辅助数组) 1093 Count PAT‘s (25分) 1101 Quick Sort (25分)

目录

1093 Count PAT's (25分)

1101 Quick Sort (25分)

---

 

1093 Count PAT's (25分)

The string APPAPT contains two PAT's as substrings. The first one is formed by the 2nd, the 4th, and the 6th characters, and the second one is formed by the 3rd, the 4th, and the 6th characters.

Now given any string, you are supposed to tell the number of PAT's contained in the string.

Input Specification:

Each input file contains one test case. For each case, there is only one line giving a string of no more than 10^​5​​ characters containing only P, A, or T.

Output Specification:

For each test case, print in one line the number of PAT's contained in the string. Since the result may be a huge number, you only have to output the result moded by 1000000007.

Sample Input:

APPAPT

Sample Output:

2

思路：leftP[]数组用于记录：当前位置i左边，即区间[0 i]上P的个数，

对于每个A能组成的PAT的个数即为它左边的P个数*它右边的T的个数，遍历所有A，结果相加即可

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#define pb push_back 
#define mod 1000000007
using namespace std;
const int maxn=100005;
string str;
int leftP[maxn]={0};

int main(){
	cin>>str;
	int len=str.length();
	for(int i=0;i<len;i++){
		if(i>0) leftP[i]=leftP[i-1];
		if(str[i]=='P') leftP[i]++;
	}
	int ans=0,rightT=0;
	for(int i=len-1;i>=0;i--){
		if(str[i]=='T') rightT++;
		else if(str[i]=='A') {
			ans=(ans+leftP[i]*rightT)%mod;
		}
	}
	printf("%d\n",ans);
	return 0;	
}

 

1101 Quick Sort (25分)

There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the pivot are moved to its left and those larger than the pivot to its right. Given N distinct positive integers after a run of partition, could you tell how many elements could be the selected pivot for this partition?

For example, given N=5 and the numbers 1, 3, 2, 4, and 5. We have:

• 1 could be the pivot since there is no element to its left and all the elements to its right are larger than it;
• 3 must not be the pivot since although all the elements to its left are smaller, the number 2 to its right is less than it as well;
• 2 must not be the pivot since although all the elements to its right are larger, the number 3 to its left is larger than it as well;
• and for the similar reason, 4 and 5 could also be the pivot.

Hence in total there are 3 pivot candidates.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10​5​​). Then the next line contains Ndistinct positive integers no larger than 10​9​​. The numbers in a line are separated by spaces.

Output Specification:

For each test case, output in the first line the number of pivot candidates. Then in the next line print these candidates in increasing order. There must be exactly 1 space between two adjacent numbers, and no extra space at the end of each line.

Sample Input:

5
1 3 2 4 5

Sample Output:

3
1 4 5

思路：同上面类似，leftmax[], rightmin[]数组，用于记录位置i左边的max和右边的min，

如果对于num[i] ,满足 leftmax[i]< num[i] <rightmin[i] ，那么这个位置就是pivot

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#define pb push_back 
#define inf 0x3f3f3f3f
using namespace std;
const int maxn=100005;
int n;
int num[maxn],leftmax[maxn],rightmin[maxn];
int res[maxn];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&num[i]);
	}
	leftmax[1]=-1;
	for(int i=2;i<=n;i++){
		leftmax[i]=max(leftmax[i-1],num[i-1]);
	}
	rightmin[n]=inf;
	for(int i=n-1;i>=1;i--){
		rightmin[i]=min(rightmin[i+1],num[i+1]);	
	}
	int cnt=0;
	for(int i=1;i<=n;i++){
		if(leftmax[i]<num[i] && num[i]<rightmin[i]){
			res[cnt++]=num[i]; 
		}
	}
    sort(res,res+cnt);
	printf("%d\n",cnt);
	for(int i=0;i<cnt;i++){
		printf("%d",res[i]);
        if(i!=cnt-1)printf(" ");       
	}
    printf("\n");//必须要有空格，否则格式错误
	return 0;	
}

巧用辅助数组