ssa 1588

The OPlayer in the ipad only supports subtitles in the SRT format, and animations generally use subtitles in ass/ssa format, so you need to convert Ass/ssa batch srt. Google a bit, in the "Ass2srt[ass/ssa batch conversion SRT]" found a ass2srt.wsf script, which reads as follows: A Windows script (. wsf) file is a text document containing Extensible Mark

How to use the. SSA File SSA is a subtitle file using Windows Media Play Classic (that is, storm audio and video) Subtitle function Windows Media Play Classic is currently the most popular playing software that supports all streaming Media formats, it is also very smooth during playback. In addition, it has a special function, that is, the subtitle loading function we will talk about here. After running th

The SSA is a subtitle file. Use the subtitles feature of Windows Media play Classic (ie: Storm audio) Windows Media Play Classic is currently the hottest player to support all streaming media formats and is very fluent when playing. In addition, it has a special function, that is what we have to talk about the loading of the caption function. After running the software, you need to make some settings for the software to enable the Load marquee feature

How do I use the KMPlayer player to display the SSA and ass subtitles effects? KMPlayer Method One, use a codec package containing VSFilter.dll (directvobsub) (Codec pack) such as K-lite or perfect decoding 1. When installing Codec Pack (Codec pack), select Directvobsub (usually the default is selected); 2. KMPlayer parameter Options-Media | decoder | filter-do not select Disabled (DivXG400 |

1588: [HNOI2002] turnover statistics time limit:5 Sec Memory limit:162 MBsubmit:9203 solved:3097[Submit] [Status] DescriptionTurnover statistics Tiger has recently been promoted to Sales manager, the first task he received after taking office was to count and analyze the company's business since its inception. Tiger took out the company's ledger, which recorded the daily turnover of the company since its inception. Analysis of the business si

(intUintdest) { in //root u to root dest - while(Pre[u]! =dest) { to if(Pre[pre[u]] = = dest) rotate (U, ch[pre[u]][0] ==u); + Else{ - inty =Pre[u]; the intD = ch[pre[y]][0] ==y; * if(Ch[y][d] = = u) {//Zig-zag $Rotate (U,!)d);Panax Notoginseng rotate (U, d); -}Else{ theRotate (y, D);//Zig-zig + rotate (U, d); A } the } + } - if(!dest) root =u; $ } $ - intInsertintk) { - intU =Root; the while(Ch[u

Test instructionsTwo bars with a length of n1,n2 (n1,n2Ask for the shortest container length that can hold them.Fix one, and the other moves on it, looking for the minimum length.Since it is possible to choose which fixed, the minimum value is calculated two times.For example:21121121122212112The above fixed, then 10, the following fixed, the minimum required 12.1#include 2#include 3#include 4#include 5#include 6#include 7#include 8#include 9#include Ten#include One#include Set> A #defineEPS 10

To learn a little bit of splay template, not so difficult to imagine, mainly left-and right-handed can be simplified to a function inside, reduce code length ...1#include 2#include 3#include 4#include 5 #defineMAXN 333336 #defineINF 0x3f3f3f3f7 #defineLC (x) ch[(x)][0]8 #defineRC (x) ch[(x)][1]9 using namespacestd;Ten intfa[maxn],ch[maxn][2],root,k[maxn],ind=1; OneInlinevoidRotateintp) A { - intq=fa[p],y=fa[q],x=ch[q][1]==p; -ch[q][x]=ch[p][x^1];fa[ch[q][x]]=Q; thech[p][x^1]=q;fa[q]=p; -fa[p]

; Elsec[z][c[z][1]==y]=x; FA[X]=z;fa[y]=x;fa[c[x][r]]=y; C[Y][L]=c[x][r];c[x][r]=y; Updata (y); Updata (x);} InchvoidSplay (intXintk) { while(x!=k) { inty=fa[x],z=Fa[y]; if(y!=k) { if((c[z][0]==y) ^ (c[y][0]==x)) rotate (x,k); Elserotate (y,k); } rotate (x,k); }}voidBuildintLintRintf) { if(L>r)return ; intMid=l+r>>1; C[f][mid>=f]=mid; Siz[mid]=1; fa[mid]=F; if(L==R)return ; Build (L,mid-1, mid); Build (mid+1, R,mid); Updata (mid);}intFindintKintRK) {pushdown (k); i

) { if(Pre[pre[r]]==goal) Rotate (r,ch[pre[r]][0]==R); Else{ intHasPre[r]; intkind=ch[pre[fa]][0]==FA; if(CH[FA][KIND]==R) {///alternating left and rightRotate (r,!kind); Rotate (R,kind); } Else{///Consistent DirectionRotate (Fa,kind); Rotate (R,kind); } } } if(!goal) Root=r;///when goal is not present, R is changed to the root node .}BOOLInsert (intkey) { intR=Root; while(ch[r][val[r]Key]) { if(Val[r]==key) {///The same

Title Link: http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1588Indicates that there is a complete algorithm class code, but that you do not understand. The specific idea is the first order, after the full use of the results of the first order, the first number of the resulting insert into the back, through this method to improve the overall efficiency.#include #include#includeusing namespacestd;#defineMax 1005intA[max];intMain () {intt,b; Long Longcount; scanf ("%d",t); while(t--) {scanf ("%d

= splaytreenode[indexson].child[1]; the returnSplaytreenode[index].key-Splaytreenode[indexson].key; the } the 98 intGetcolost_2 (intindex) About { - intIndexson = splaytreenode[index].child[1];101 if(Indexson = =0)102 returnINF;103 while(splaytreenode[indexson].child[0])104Indexson = splaytreenode[indexson].child[0]; the return-splaytreenode[index].key +Splaytreenode[indexson].key;106 }107 108 intMain ()109 { the inti;111 while(SCANF ("%d", n)! =EOF) { theS

Hdu 1588 Gauss Fibonacci (matrix Rapid power) Gauss Fibonacci Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 2090 Accepted Submission (s): 903 Problem DescriptionWithout expecting, Angel replied quickly. she says: "I 'v heard that you' r a very clever boy. so if you wanna me be your GF, you shoshould solve the problem called GF ~. " How good an opportunity that Gardon can not give up! The "Proble

Http://www.lydsy.com/JudgeOnline/problem.php? Id = 1588 # Include

HDU 1588 Gauss Fibonacci (matrix Rapid power + binary proportional sequence summation), hdufibonacciHDU 1588 Gauss Fibonacci (matrix Rapid power + binary proportional sequence summation) ACM Topic address: HDU 1588 Gauss Fibonacci Question:G (I) = k * I + B; I is a variable.Given k, B, n, M, question (f (g (0) + f (g (1) +... + f (g (n) % M value. Analysis:If we

HDU 1588 Gauss Fibonacci (matrix Rapid power + binary proportional sequence summation) ACM Topic address: HDU 1588 Gauss Fibonacci Question:G (I) = K * I + B; I is a variable.Given K, B, n, m, question (f (G (0) + f (G (1) +... + f (G (N) % m value. Analysis:If we include the Fibonacci matrix, we will find that this is an equiratio sequence.Push down: S(g(i)) = F(b) + F(b+k) + F(b+2k) + .... + F(b+nk