第四届蓝桥杯C++本科B组预赛解题报告

第四届蓝桥杯C++本科B组解题报告

-转自themagickeyjianan的专栏

分类： 蓝桥杯 2013-05-19 15:53 294人阅读 评论(0) 收藏 举报

<1> 高斯日记
1799-7-16

[java] view plain copy print ?

1. package JiaNan;
2. import java.util.Calendar;
3. import java.util.GregorianCalendar;
4. public class GaoSiRiJi
5. {
6. static Calendar c = new GregorianCalendar(1791,12-1,15);
7. public staticvoid main(String args[])
8. {
9. c.add(Calendar.DATE,8113-5343);
10. System.out.println(c.get(Calendar.YEAR)+"-"+c.get(Calendar.MONTH)+"-"+c.get(Calendar.DATE));
11. }
12. }
13. 
    
14. /*
15. 1799-7-16 //注意：Java中月份是从0开始的，因此虽然输出是1799-6-16，但是要写成1799-7-16
16. */

package JiaNan;
import java.util.Calendar;
import java.util.GregorianCalendar;
public class GaoSiRiJi
{
    static  Calendar c = new GregorianCalendar(1791,12-1,15);
	public static void main(String args[])
	{
		c.add(Calendar.DATE,8113-5343);
		System.out.println(c.get(Calendar.YEAR)+"-"+c.get(Calendar.MONTH)+"-"+c.get(Calendar.DATE));
	}
} 

/*
1799-7-16      //注意：Java中月份是从0开始的，因此虽然输出是1799-6-16，但是要写成1799-7-16
*/

<2>马虎的算式
142

方法1:高层循环，穷举法

[java] view plain copy print ?

1. package JiaNan;
2. public class MaHuDeSuanShi
3. {
4. static int kinds =0;
5. static void f()
6. {
7. for(int a =1; a <= 9;a++)
8. for(int b =1; b <= 9;b++)
9. for(int c =1; c <= 9;c++)
10. for(int d =1; d <= 9;d++)
11. for(int e =1; e <= 9;e++)
12. {
13. int ab = 10*a + b;
14. int cde = 100*c +10*d + e;
15. int adb = 100*a + 10*d + b;
16. int ce = 10*c + e;
17. if(ab*cde != adb*ce)
18. continue;
19. 
    
20. int num[] = newint[10];
21. num[a]++;
22. num[b]++;
23. num[c]++;
24. num[d]++;
25. num[e]++;
26. int i;
27. for(i = 1;i <=9;i++)
28. {
29. if(num[i] > 1)
30. break;
31. }
32. 
    
33. if(i == 10)
34. {
35. //System.out.println(ab+"*"+cde+"="+adb+"*"+ce);
36. kinds++;
37. }
38. }
39. }
40. public staticvoid main(String args[])
41. {
42. long start = System.nanoTime();
43. f();
44. System.out.println(kinds);
45. long end = System.nanoTime();
46. System.out.println("运行时间："+(end-start)/Math.pow(10,9)+"s");
47. }
48. }
49. 
    
50. /*
51. 142
52. 运行时间：0.010208086s
53. */

package JiaNan;
public class MaHuDeSuanShi
{
    static int kinds = 0;
    static void f()
    {
    	for(int a = 1; a <= 9;a++)
    		for(int b = 1; b <= 9;b++)
    			for(int c = 1; c <= 9;c++)
    				for(int d = 1; d <= 9;d++)
    					for(int e = 1; e <= 9;e++)
    					{
    						int ab = 10*a + b;
    						int cde = 100*c + 10*d + e;
    						int adb = 100*a + 10*d + b;
    						int ce = 10*c + e;
    						if(ab*cde != adb*ce)
    							continue;
    						
    						int num[] = new int[10]; 
    						num[a]++;
    						num[b]++;
    						num[c]++;
    						num[d]++;
    						num[e]++;
    						int i;
    						for(i = 1;i <= 9;i++)
    						{
    							if(num[i] > 1)
    								break;
    						}
    						
    						if(i == 10)
  						    {
    					       //System.out.println(ab+"*"+cde+"="+adb+"*"+ce);
  							   kinds++;
  						    }
    					}
    }
	public static void main(String args[])
	{
		long start = System.nanoTime();
		f();
		System.out.println(kinds);
		long end = System.nanoTime();
		System.out.println("运行时间："+(end-start)/Math.pow(10, 9)+"s");
	}
} 

/*
142
运行时间：0.010208086s
*/

方法2:运用排列，进行穷举法

[java] view plain copy print ?

1. package JiaNan;
2. public class MaHuDeSuanShi
3. {
4. static int kinds =0;
5. static int c[] =new int[6];//枚举排列
6. static boolean vis[] =new boolean[10];//记录是否被访问
7. static void check(int c[])
8. {
9. int ab = c[1]*10 + c[2];
10. int cde = c[3]*100 + c[4]*10 + c[5];
11. int adb = c[1]*100 + c[4]*10 + c[2];
12. int ce = c[3]*10 + c[5];
13. if(ab*cde == adb*ce)
14. {
15. //System.out.println(ab+"*"+cde+"="+adb+"*"+ce);
16. kinds++;
17. }
18. }
19. static void dfs(int start,int n)
20. {
21. if(start == 6)
22. {
23. check(c);
24. return;
25. }
26. for(int i =1;i <= n;i++)
27. {
28. if(!vis[i])
29. {
30. c[start] = i;
31. vis[i] = true;
32. dfs(start+1,n);
33. vis[i] = false;
34. c[start] = 0;
35. }
36. }
37. }
38. public staticvoid main(String args[])
39. {
40. long start = System.nanoTime();
41. dfs(1,9);
42. System.out.println(kinds);
43. long end = System.nanoTime();
44. System.out.println("运行时间："+(end-start)/Math.pow(10,9)+"s");
45. }
46. }
47. 
    
48. /*
49. 142
50. 运行时间：0.002564503s
51. */
52. //备注：由此可见，排列是一种比较高效率的算法，大约效率是循环穷举的5倍。由此想到21位水仙花也是利用排列做的，效率都非常高

package JiaNan;
public class MaHuDeSuanShi
{
    static int kinds = 0;
    static int c[] = new int[6];         //枚举排列
    static boolean vis[] = new boolean[10];  //记录是否被访问
    static void check(int c[])
    {
		int ab = c[1]*10 + c[2];
		int cde = c[3]*100 + c[4]*10 + c[5];
		int adb = c[1]*100 + c[4]*10 + c[2];
		int ce = c[3]*10 + c[5];
		if(ab*cde == adb*ce)
		{
			//System.out.println(ab+"*"+cde+"="+adb+"*"+ce);
			kinds++;
		}
    }
    static void dfs(int start,int n)
    {
		if(start == 6)
		{
			check(c);
			return;
		}
    	for(int i = 1;i <= n;i++)
		{
		   if(!vis[i])
		   {
			  c[start] = i;
			  vis[i] = true;
			  dfs(start+1,n);
			  vis[i] = false;
			   c[start] = 0;
		   }
		}
	}
	public static void main(String args[])
	{
		long start = System.nanoTime();
		dfs(1,9);
		System.out.println(kinds);
		long end = System.nanoTime();
		System.out.println("运行时间："+(end-start)/Math.pow(10, 9)+"s");	
	}
} 

/*
142
运行时间：0.002564503s
*/
//备注：由此可见，排列是一种比较高效率的算法，大约效率是循环穷举的5倍。由此想到21位水仙花也是利用排列做的，效率都非常高

<3>39台阶
51167078

[java] view plain copy print ?

1. package JiaNan;
2. public class _39TaiJie
3. {
4. static int kinds =0;
5. static int c[] =new int[40];//最多走39步
6. static int choice[] =new int[]{1,2};
7. static void dfs(int start,int n)
8. {
9. if(n <= 0)
10. {
11. if(n==0 && start%2==0)
12. {
13. kinds++;
14. }
15. return;
16. }
17. for(int i =0;i <= 1;i++)
18. {
19. c[start] = choice[i];
20. dfs(start+1,n-choice[i]); //对比上一题，总结何时需要恢复：当要避免重复时就需要vis数组记录一下避免重复，还有韩信走马分酒问题也是用了vis
21. }
22. }
23. public staticvoid main(String args[])
24. {
25. long start = System.nanoTime();
26. dfs(0,39);
27. System.out.println(kinds);
28. long end = System.nanoTime();
29. System.out.println("运行时间："+(end-start)/Math.pow(10,9)+"s");
30. }
31. }
32. 
    
33. /*
34. 51167078
35. 运行时间：5.390165205s
36. */

package JiaNan;
public class _39TaiJie
{
    static int kinds = 0;
    static int c[] = new int[40];   //最多走39步
    static int choice[] = new int[]{1,2};
    static void dfs(int start,int n)
    {
    	if(n <= 0)
    	{
    		if(n==0 && start%2==0)
    		{
    			kinds++;
    		}
    		return;
    	}
    	for(int i = 0;i <= 1;i++)
    	{
    		c[start] = choice[i];
    		dfs(start+1,n-choice[i]);        //对比上一题，总结何时需要恢复：当要避免重复时就需要vis数组记录一下避免重复，还有韩信走马分酒问题也是用了vis
    	}
    }
	public static void main(String args[])
	{
		long start = System.nanoTime();
		dfs(0,39);
		System.out.println(kinds);	
		long end = System.nanoTime();
		System.out.println("运行时间："+(end-start)/Math.pow(10, 9)+"s");	
	}
} 

/*
51167078
运行时间：5.390165205s
*/

<4>黄金连分数
0.6180339887498948482045868343656381177203091798057628621354486227052604628189024497050372347293136948
算法思想：在用递归f(n) = 1/(1+f(n-1));求解的过程中一直精确到300位，在最后输出时，再四舍五入到100位，这样将精度损失避免到最小

[java] view plain copy print ?

1. package JiaNan;
2. import java.math.BigDecimal;
3. import java.math.MathContext;
4. public class HuangJinLianFenShu
5. {
6. static BigDecimal f(int n)
7. {
8. if(n == 1)
9. return BigDecimal.valueOf(1.0);
10. return BigDecimal.valueOf(1.0).divide(new BigDecimal(BigDecimal.valueOf(1.0).add(f(n-1)).toString()),new MathContext(300));
11. }
12. public staticvoid main(String args[])
13. {
14. long start = System.nanoTime();
15. BigDecimal des = new BigDecimal(f(200).toString(),new MathContext(100));
16. System.out.println(des);
17. long end = System.nanoTime();
18. System.out.println("运行时间："+(end-start)/Math.pow(10,9)+"s");
19. }
20. }
21. /*
22. 0.6180339887498948482045868343656381177203091798057628621354486227052604628189024497050372347293136948
23. 运行时间：0.08024721s
24. */

package JiaNan;
import java.math.BigDecimal;
import java.math.MathContext;
public class HuangJinLianFenShu
{
    static BigDecimal f(int n)
    {
     if(n == 1)
      return BigDecimal.valueOf(1.0);
     return BigDecimal.valueOf(1.0).divide(new BigDecimal(BigDecimal.valueOf(1.0).add(f(n-1)).toString()),new MathContext(300)); 
    }
 public static void main(String args[])
 {
  long start = System.nanoTime();
  BigDecimal des = new BigDecimal(f(200).toString(),new MathContext(100));
  System.out.println(des);
  long end = System.nanoTime();
  System.out.println("运行时间："+(end-start)/Math.pow(10, 9)+"s"); 
 }
}
/*
0.6180339887498948482045868343656381177203091798057628621354486227052604628189024497050372347293136948
运行时间：0.08024721s
*/

<5>前缀判断
*haystack++ != *needle++

[cpp] view plain copy print ?

1. #include<iostream>
2. using namespace std;
3. char* prefix(char* haystack_start,char* needle_start)
4. {
5. char* haystack = haystack_start;
6. char* needle = needle_start;
7. while(*haystack && *needle)
8. {
9. if(*haystack++ != *needle++)
10. return NULL; //填空位置
11. }
12. if(*needle)
13. return NULL;
14. return haystack_start;
15. }
16. 
    
17. void main()
18. {
19. cout<<prefix("abc123","abc")<<endl;
20. }
21. /*
22. abc123
23. */

#include<iostream>
using namespace std;
char* prefix(char* haystack_start, char* needle_start)
{ 
	char* haystack = haystack_start; 
	char* needle = needle_start; 
	while(*haystack && *needle)
	{
		if(*haystack++ != *needle++) 
			return NULL; //填空位置 
	} 
	if(*needle) 
		return NULL;
	return haystack_start; 
}

void main()
{
	cout<<prefix("abc123","abc")<<endl;
}
/*
abc123
*/

<6>三部排序
p++

[cpp] view plain copy print ?

1. #include<iostream>
2. using namespace std;
3. void sort3p(int* x,int len)
4. {
5. int p = 0;
6. int left = 0;
7. int right = len-1;
8. while(p<=right)
9. {
10. if(x[p]<0)
11. {
12. int t = x[left];
13. x[left] = x[p];
14. x[p] = t;
15. left++;
16. p++;
17. }
18. else if(x[p]>0)
19. {
20. int t = x[right];
21. x[right] = x[p];
22. x[p] = t;
23. right--;
24. }
25. else
26. {
27. p++; //填空位置
28. }
29. }
30. }
31. 
    
32. void main()
33. {
34. int x[] = {25,18,-2,0,16,-5,33,21,0,19,-16,25,-3,0};
35. sort3p(x,sizeof(x)/sizeof(x[0]));
36. for(int i = 0;i <sizeof(x)/sizeof(x[0]);i++)
37. cout<<x[i]<<" ";
38. cout<<endl;
39. }
40. 
    
41. /*
42. -3 -2 -16 -5 0 0 0 21 19 33 25 16 18 25
43. */

#include<iostream>
using namespace std;
void sort3p(int* x, int len) 
{ 
	int p = 0;
	int left = 0; 
	int right = len-1;
	while(p<=right)
	{ 
		if(x[p]<0)
		{ 
			int t = x[left];
			x[left] = x[p]; 
			x[p] = t; 
			left++; 
			p++; 
		} 
		else if(x[p]>0)
		{ 
			int t = x[right];
			x[right] = x[p]; 
			x[p] = t; 
			right--; 
		} 
		else
		{
			p++; //填空位置 
		} 
	} 
}

void main()
{
	int x[] = {25,18,-2,0,16,-5,33,21,0,19,-16,25,-3,0};
	sort3p(x,sizeof(x)/sizeof(x[0]));
	for(int i = 0;i < sizeof(x)/sizeof(x[0]);i++)
		cout<<x[i]<<" ";
	cout<<endl;
}

/*
-3 -2 -16 -5 0 0 0 21 19 33 25 16 18 25
*/

<7>错误票据

[cpp] view plain copy print ?

1. #include<iostream>
2. #include<vector>
3. using namespace std;
4. void f(int N)
5. {
6. if(N == 0)
7. return;
8. vector<int> v;
9. int row = 0;
10. while(1)
11. {
12. int num;
13. cin>>num;
14. v.push_back(num);
15. if(cin.get() == '\n')
16. {
17. if(++row == N)
18. break;
19. }
20. }
21. 
    
22. int min = v[0],max = v[0];
23. for(int i = 1;i <= v.size()-1;i++)
24. {
25. if(v[i] < min)
26. min = v[i];
27. if(v[i] > max)
28. max = v[i];
29. }
30. 
    
31. int* len = new int[max];
32. for(int m = 0;m < max;m++)
33. {
34. len[m] = 0;
35. }
36. 
    
37. for(int j = 0;j <= v.size()-1;j++)
38. {
39. len[v[j]]++;
40. }
41. 
    
42. for(int k = min;k <= max;k++)
43. {
44. if(len[k] == 0)
45. cout<<k<<" ";
46. if(len[k] > 1)
47. cout<<k<<" ";
48. }
49. }
50. 
    
51. void main()
52. {
53. int N;
54. cin>>N;
55. f(N);
56. cout<<endl;
57. }

#include<iostream>
#include<vector>
using namespace std;
void f(int N)
{
    if(N == 0)
		return;
	vector<int> v;
	int row = 0;
	while(1)
	{
		int num;
		cin>>num;
		v.push_back(num);
		if(cin.get() == '\n')
		{
			if(++row == N)
				break;
		}
	}
	
	int min = v[0],max = v[0];
	for(int i = 1;i <= v.size()-1;i++)
	{
		if(v[i] < min)
			min = v[i];
		if(v[i] > max)
			max = v[i];
	}
	
	int* len = new int[max];
	for(int m = 0;m < max;m++)
	{
		len[m] = 0;
	}

	for(int j = 0;j <= v.size()-1;j++)
	{
		len[v[j]]++;
	}

	for(int k = min;k <= max;k++)
	{
		if(len[k] == 0)
			cout<<k<<" ";
		if(len[k] > 1)
			cout<<k<<" ";
	}
}

void main()
{
	int N;
	cin>>N;
	f(N);
	cout<<endl;
}

<8>翻硬币

[cpp] view plain copy print ?

1. #include<iostream>
2. using namespace std;
3. int f(char sorc[],char dest[])
4. {
5. int minTimes = 0;//最少翻转次数
6. char* p = sorc;
7. char* q = dest;
8. while(*p=='o' || *p=='*')
9. {
10. if(*p != *q)
11. {
12. switch(*p)
13. {
14. case '*':
15. *p = 'o';
16. if(*(p+1) == '*')
17. {
18. *(p+1) = 'o';
19. }
20. else
21. {
22. if(*(p+1) == 'o')
23. *(p+1) = '*';
24. }
25. p++;
26. q++;
27. minTimes++;
28. break;
29. case 'o':
30. *p = '*';
31. if(*(p+1) == '*')
32. {
33. *(p+1) = 'o';
34. }
35. else
36. {
37. if(*(p+1) == 'o')
38. *(p+1) = '*';
39. }
40. p++;
41. q++;
42. minTimes++;
43. break;
44. }
45. }
46. else //设计程序，当你考虑到相等的情况，就要考虑到不等的情况
47. {
48. p++;
49. q++;
50. }
51. }
52. return minTimes;
53. }
54. 
    
55. 
    
56. void main()
57. {
58. char sroc[30];
59. char dest[30];
60. cin>>sroc>>dest;
61. cout<<f(sroc,dest)<<endl;
62. }
63. 
    
64. /*
65. **********
66. o****o****
67. 5
68. */

#include<iostream>
using namespace std;
int f(char sorc[],char dest[])
{
	int minTimes = 0;   //最少翻转次数
	char* p = sorc;
	char* q = dest;
	while(*p=='o' || *p=='*')
	{
		if(*p != *q)
		{
			switch(*p)
			{
			case '*':
				*p = 'o';
				if(*(p+1) == '*')
				{
					*(p+1) = 'o';
				}
				else
				{
					if(*(p+1) == 'o')
					    *(p+1) = '*';
				}
				p++;
				q++;
				minTimes++;
				break;
			case 'o':
					*p = '*';
				if(*(p+1) == '*')
				{
					*(p+1) = 'o';
				}
				else
				{
					if(*(p+1) == 'o')
					    *(p+1) = '*';
				}
				p++;
			    q++;
				minTimes++;
				break;
			}
		}
		else             //设计程序，当你考虑到相等的情况，就要考虑到不等的情况
		{
			p++;
			q++;
		}
	}
	return minTimes;
}


void main()
{
	char sroc[30];
	char dest[30];
	cin>>sroc>>dest;
	cout<<f(sroc,dest)<<endl;
}

/*
**********
o****o****
5
*/

<9>带分数

[cpp] view plain copy print ?

1. #include<iostream>
2. #include<ctime>
3. using namespace std;
4. int N;
5. int c[10]; //记录1-9数字的全排列
6. bool vis[10]; //记录空间节点是否被访问过
7. int kinds = 0;
8. //
9. int GetWeiShu(int N)//得到一个指定数字的位数
10. {
11. int weishu = 0;
12. while(N > 0)
13. {
14. weishu++;
15. N /= 10;
16. }
17. return weishu;
18. }
19. 
    
20. /
21. int GetNum(int start,int end)
22. {
23. int sum = 0;
24. for(int i = start;i <= end;i++)
25. {
26. sum = sum*10 + c[i];
27. }
28. return sum;
29. }
30. 
    
31. /
32. void check(int N,int* c)
33. {
34. for(int i = 1;i <= GetWeiShu(N);i++)
35. {
36. int midMinLen = (9-i+1)/2;
37. for(int j = i+midMinLen;j <= 8;j++)
38. {
39. int X = GetNum(1,i);
40. int Y = GetNum(i+1,j);
41. int Z = GetNum(j+1,9);
42. if(Y%Z==0 && N==X+Y/Z)
43. {
44. //cout<<N<<"="<<X<<"+"<<Y<<"/"<<Z<<endl;
45. kinds++;
46. }
47. }
48. }
49. 
    
50. }
51. 
    
52. /
53. void dfs(int start,int n)
54. {
55. if(start == 10)
56. {
57. check(N,c);
58. return;
59. }
60. 
    
61. for(int i = 1;i <= n;i++)
62. {
63. if(!vis[i])
64. {
65. c[start] = i;
66. vis[i] = true;
67. dfs(start+1,n);
68. vis[i] = false;
69. }
70. }
71. }
72. 
    
73. 
    
74. void main()
75. {
76. double start = clock();
77. cin>>N;
78. dfs(1,9);
79. double end = clock();
80. cout<<"一共有:"<<kinds<<"种情况"<<endl;
81. cout<<"运行时间:"<<(end-start)/CLOCKS_PER_SEC<<"s"<<endl;
82. 
    
83. }
84. 
    
85. /*
86. 100
87. 100=3+69258/714
88. 100=81+5643/297
89. 100=81+7524/396
90. 100=82+3546/197
91. 100=91+5742/638
92. 100=91+5823/647
93. 100=91+7524/836
94. 100=94+1578/263
95. 100=96+1428/357
96. 100=96+1752/438
97. 100=96+2148/537
98. 一共有:11种情况
99. 运行时间:8.41s
100. 
     
101. 105
102. 105=72+6534/198
103. 105=87+3456/192
104. 105=87+9612/534
105. 105=92+5681/437
106. 105=92+6734/518
107. 105=98+3647/521
108. 一共有:6种情况
109. 运行时间:3.512s
110. */

#include<iostream>
#include<ctime>
using namespace std;
int N;
int c[10];      //记录1-9数字的全排列
bool vis[10];   //记录空间节点是否被访问过
int kinds = 0;
//
int GetWeiShu(int N)     //得到一个指定数字的位数
{
   int weishu = 0;
   while(N > 0)
   {
	   weishu++;
	   N /= 10;
   }
   return weishu;
}

/
int GetNum(int start,int end)
{
	int sum = 0;
	for(int i = start;i <= end;i++)
	{
		sum = sum*10 + c[i];
	}
	return sum;
}

/
void check(int N,int* c)
{
   for(int i = 1;i <= GetWeiShu(N);i++)
   {
	   int midMinLen = (9-i+1)/2;
	   for(int j = i+midMinLen;j <= 8;j++)
	   {
           int X = GetNum(1,i);
		   int Y = GetNum(i+1,j);
		   int Z = GetNum(j+1,9);
		   if(Y%Z==0 && N==X+Y/Z)
		   {
			   //cout<<N<<"="<<X<<"+"<<Y<<"/"<<Z<<endl;
			   kinds++;
		   }
	   }
   }

}

/
void dfs(int start,int n)
{
	if(start == 10)
	{
		check(N,c);
		return;
	}

	for(int i = 1;i <= n;i++)
	{
		if(!vis[i])
		{
			c[start] = i;
			vis[i] = true;
			dfs(start+1,n);
			vis[i] = false;
		}
	}
}


void main()
{
	double start = clock();
	cin>>N;
	dfs(1,9);
	double end = clock();
	cout<<"一共有:"<<kinds<<"种情况"<<endl;
	cout<<"运行时间:"<<(end-start)/CLOCKS_PER_SEC<<"s"<<endl;

}

/*
100
100=3+69258/714
100=81+5643/297
100=81+7524/396
100=82+3546/197
100=91+5742/638
100=91+5823/647
100=91+7524/836
100=94+1578/263
100=96+1428/357
100=96+1752/438
100=96+2148/537
一共有:11种情况
运行时间:8.41s

105
105=72+6534/198
105=87+3456/192
105=87+9612/534
105=92+5681/437
105=92+6734/518
105=98+3647/521
一共有:6种情况
运行时间:3.512s
*/

<10>连号区间数

[cpp] view plain copy print ?

1. #include<iostream>
2. #include<vector>
3. using namespace std;
4. 
   
5. vector<int> v;
6. int kinds = 0;
7. 
   
8. //
9. int GetMin(const vector<int> & v,int start,int end)
10. {
11. int min = v[start];
12. for(int i = start;i <= end;i++)
13. {
14. if(v[i] < min)
15. min = v[i];
16. }
17. return min;
18. }
19. 
    
20. //
21. int GetMax(const vector<int> & v,int start,int end)
22. {
23. int max = v[start];
24. for(int i = start;i <= end;i++)
25. {
26. if(v[i] > max)
27. max = v[i];
28. }
29. return max;
30. }
31. 
    
32. //
33. void f(const vector<int> & v)
34. {
35. for(int i = 0;i < v.size();i++)
36. for(int j = 0;j < v.size();j++)
37. {
38. int min = GetMin(v,i,j);
39. int max = GetMax(v,i,j);
40. if(j-i+1 == max-min+1)
41. {
42. kinds++;
43. }
44. }
45. }
46. 
    
47. void main()
48. {
49. 
    
50. int N;
51. cin>>N;
52. while(N--)
53. {
54. int num;
55. cin>>num;
56. v.push_back(num);
57. }
58. f(v);
59. cout<<kinds<<endl;
60. }
61. 
    
62. /*
63. 5
64. 3 4 2 5 1
65. 9
66. */