锘??xml version="1.0" encoding="utf-8" standalone="yes"?> (1) The first element of W-sequence must be 1. (2) The matched left parenthesis is the closest unmatched left parenthesis. (3) The left must have left parenthesis and the first right parenthiesis matches with the left parenthesis nearest to it. (4) If , ,else w[i]=i+1; the subscript must be from 0.
灝辨槸姹備竴涓暟鐨勭害鏁頒釜鏁般傝嫢鏈夊鏁頒釜綰︽暟錛屽紑闂紱鍋舵暟涓紝鍏抽棬銆?br>璁炬湁涓鏁癗鏈夋湁綰︽暟B錛屽垯蹇呮湁鍙︿竴綰︽暟N/B錛屽叾鎬繪槸鎴愬鍑虹幇銆?br>鎯熺嫭瀹屽叏騫蟲柟鏁癗=B*B錛屾鏄彧鏈変竴涓害鏁頒簡錛屽畬鍏ㄥ鉤鏂規暟鐨勭害鏁頒負濂囨暟涓?/p>
#include"iostream"
#include"stdio.h"
using namespace std;
int a[12],b[12],t,n,asw;
int num(int n)
{ int i=0;
while(n>=b[i])//n<b[i] stop out a[i-1]
{
i++;
}
return a[i-1];
}
int main()
{
for(int i=1;i<=12;i++)
{a[i-1]=i;
b[i-1]=i*i;
}
scanf("%d",&t);
while(t)
{scanf("%d",&n);
asw=num(n);
printf("%d\n",asw);
t--;
}
return 0;
}
鏈鐩噸鐐瑰湪浜庤緭鍑虹殑鎺у埗涓婏紝鍥犱負涓嶈兘浠庝笅寰涓婅緭鍑猴紝鍥犳杈撳嚭鏃舵槸浠庡乏寰鍙籌紝鑷笂鑰屼笅鐨勮緭鍑恒傛暟瀛桸鐪嬫垚瀛楃涓叉潵澶勭悊銆備竴鍏卞崄涓瓧絎︼紝濡備綍鎺у埗銆傦棘錛o激杈撳嚭錛屽張鍙竷孌墊暟鐮佺錛岀敱姝ゅ彲浠ュ緱鍒板惎鍙戯紝錛戯紣涓瓧絎︼紝姣忎釜瀛楃錛楁錛屽垯寤轟竴涓紬錛革紤錛愮殑浜岀淮鐭╅樀瀛樺偍絎旂敾淇℃伅錛屼篃灝辨槸涓涓簩緇存暟緇勩傝鍩轟簬錛楁鏁扮爜綆$殑鎬濇兂杈撳嚭銆備簩緇寸煩闃電殑淇℃伅姣旇緝瀹規槗寰楀埌銆?/p>
#include<stdio.h>
#include<string.h>
void main()
{
void dup(char c,int n);
char line[7][11]=
{"- -- -----","| ||| ||","||||| |||"," ----- --","| | | | ","|| |||||||","- -- -- --"};//鎬誨叡7絎旓紝姣忎竴絎斿姣忎竴涓暟瀛楁樉紺轟笉鍚?/span>
char str[9];//鍒╃敤瀛楃涓插鐞嗘祴璇曟暟鎹皢鐨勫張鏄湪鍙灞忓箷鑳藉涓?涓嶇鏁版嵁澶у皬
int s,i,j,k,t;
while(scanf("%d%s",&s,str)&&s!=0)//杈撳叆嫻嬭瘯鏁版嵁鐩村埌杈撳叆0 0 涓烘錛屽疄闄呬笂鍙鍒ゆ柇杈撳叆鐨剆涓?鍗沖彲銆?/span>
{
for(j=0;j<7;j++)//鎸夌瑪鐢昏緭鍑轟負寰幆鏉′歡錛屼竴鍏辮緭鍑?絎旓紝絎旂敾浠?鍒?
{
if(j%3==0)//杈撳嚭絎?nbsp;0 3 6絎旂殑鏃跺欐寜濡備笅鏍煎紡
{
for(k=0;k<strlen(str);k++)
{
printf(" ");
t=(int)(str[k]-48);//瀛楃杞崲鎴愬搴旂殑鏁板瓧
dup(line[j][t],s);//閲嶅杈撳嚭s涓絎旂敾
printf(" ");
}
printf("\n");//姣忔杈撳嚭涓絎斿悗鎹㈣
}
else //杈撳嚭絎? 2 4 5 絎旂殑鏃跺欐寜濡備笅鏍煎紡
{
for(i=1;i<=s;i++)//閲嶅杈撳嚭s涓絎旂敾錛屼絾鏄鎹㈣
{
for(k=0;k<strlen(str);k++)//絎? 2 鍜岀4 5 絎旀槸榪炲湪涓琛岃緭鍑虹殑
{
t=(int)(str[k]-48);
printf("%c",line[j][t]);
dup(' ',s);
printf("%c",line[j+1][t]);
printf(" ");
}
printf("\n");//姣忔杈撳嚭涓絎斿悗鎹㈣,瀵? 2 4 5 鑰岃█鏄緭鍑?絎斿氨鎹㈣
}
j=j+1;
}
}
printf("\n");//涓や釜嫻嬭瘯鏁版嵁鐨勮緭鍑虹粨鏋滄崲琛?絎竴嬈℃彁浜ら敊璇氨鏄姱鍦ㄨ繖鍎?/span>
}
}
void dup(char c,int n)//閲嶅杈撳嚭瀛楃鍑芥暟錛岀敤浜庨噸澶嶈緭鍑簊涓瓧絎?/span>
{
int i;
for(i=1;i<=n;i++)
printf("%c",c);
}
錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛?
鍒嗘瀽錛?br>
#include"iostream"
#include"stdio.h"
using namespace std;
int p[21],w[21],t,n,k;
bool flag;
int main()
{
scanf("%d",&t);
for(int i=0;i<t;i++)
{
scanf("%d",&n);
for(int j=0;j<n;j++)
scanf("%d",&p[j]);
w[0]=1;
for(int j=1;j<n;j++)
{
flag=false;
for(k=j-1;k>=0;k--)
{
if(p[j]-p[k]>=j-k)
{
w[j]=j-k;
flag=true;
break;
}
}
if(flag==true)
{
continue;
}
else
w[j]=j+1;
}
for(int i=0;i<n;i++)
printf("%d ",w[i]);
printf("\n");
}
return 0;
}