PAT TOP 1020. Delete At Most Two Characters (35)

1020. Delete At Most Two Characters (35)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

8000 B

判题程序

Standard

作者

CAO, Peng

Given a string which contains only lower case English letters, how many different strings you can get after deleting AT MOST TWO characters in it?

Input Specification:

Each input file contains one test case, which gives the string whose length is in [3, 10⁶].

Output Specification:

Print in a line the number of different strings you can get after deleting at most 2 characters.

Sample Input:

ababcc

Sample Output:

15

Hint:

Deleting 0 character gets "ababcc".
Deleting 1 character gets "babcc", "aabcc", "abbcc", "abacc" and "ababc". 
Deleting 2 character gets "abcc", "bbcc", "bacc", "babc", "aacc", "aabc", "abbc", "abac" and "abab".

这题其实是一道数学题吧。。。

在计数过程中只需要考虑一些特殊情况

1.删除一个有n个字符的串，总共有t=1+n+n（n-1）/2种删除方式；

2.当只删除一个字符时，当且仅当s[i]==s[i-1]时会有重复；

3.当删除两个字符时的重复情况可以分成以下三种：

（1）.串具有.....(X1,X2,...Xn).....的形式时,其中X1==X2==...==Xn，设串中任意字符Y，则删除(Y,Xi)是重复的；

(2).串具有.....(X1,X2,...Xn).....(Y1,Y2,...Yn).....的形式时,其中X1==X2==...==Xn，Y1==Y2==...==Yn,则删除(Yi,Xi)重复的；

(3).串具有.....(X1,Y,X2),.....的形式时,其中X1==X2，则删除(Y,X1)和(Y,X2)重复的；

AC代码：

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47

#include<bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); // freopen("data.txt","r",stdin); string ss; cin>>ss; long long sum,k=ss.size(); long long t=1+k+k*(k-1)/2,con=1,scon=0,spart=0; for(long long i=1;i<k;i++) { if(ss[i]==ss[i-1]) { con++; t--; } else { if(con>1) { if(spart) t=t-scon*con+spart; t=t-con*(con-1)/2+1; scon=scon+con; spart++; } con=1; if(i>1&&ss[i]==ss[i-2]) t--; } } if(con>1) { if(spart) t=t-scon*con+spart; t=t-con*(con-1)/2+1; scon=scon+con; spart++; } if(spart) t=t-(k-scon)*(scon-spart); cout<<t; return 0; }