2021 - 不完全统计

通过次数

0

提交次数

0

时间限制 : 1 秒 内存限制 : 128 MB
据不完全统计,大湿已经在各地OJ刷题数百,秒杀CCNU各路大神,更加吊炸天的是,他每次刷题难度系数严格递增!例如:数组A={1, 4, 4, 2, 6, 3}是大湿最近的刷题记录,里面的数字代表难度系数,因为A可以分为{1,4},{4},{2,6},{3} 4个严格递增的序列,所以大湿最近一共刷题4次,由于暑假集训要交刷题记录,你能帮大湿统计一下他的刷题次数吗?

题目输入

第一行 t,测试数据总数
对于每组测试数据
第一行 n,代表大湿刷题总数(1=<n<=50)
第二行 n个整数,代表每题的难度系数。每个整数在1到50之间。

题目输出

对于每组测试数据,输出一行,刷题次数。

输入/输出样例

输入格式

4
6
1 4 4 2 6 3
7
5 8 9 12 16 32 50
8
1 1 9 9 2 2 3 3
1
42

输出格式

4
1
6
1

C语言解答

#include<stdio.h>

int main()
{
	int t,n;
	scanf("%d",&t);
	while(scanf("%d",&n)!=EOF)
	{
		int a[50]={0};
		int i,j,k=0;
		for(i=0;i<n;i++)
		scanf("%d",&a[i]);
		for(i=0;i<n;)
		{
			  while(a[i]<a[i+1])
				i++;
			if(a[i]>=a[i+1])
			{
				k++;
				i++;
			}

		}
		printf("%d\n",k);
	}
	return 0;
}

C++解答

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;

int main()
{

    int t;
    cin>>t;
    int n;
    int a[105];
    int count;
    while(t--)
    {
        cin>>n;
        int i;
        for(i=0;i<n;i++)
        {
            cin>>a[i];

        }
count=1;



            for(i=0;i<n-1;i++)

           if(a[i]>=a[i+1])
           {
               count++;

           }








        cout<<count<<endl;

    }



    return 0;
}


Java解答

import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author brl1
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		Task solver = new Task();
		solver.solve(1, in, out);
		out.close();
	}
}

class Task {
	public void solve(int testNumber, InputReader cin, OutputWriter out) {
		int T=cin.nextInt();
		while(T-->0){
			int n=cin.nextInt();
			int ans=1;
			int last=-10;
			while(n-->0){
				int now=cin.nextInt();
				if(now<=last){
					ans++;
				}
				last=now;
			}
			out.println(ans);
		}
	}
}

class InputReader {

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public InputReader(InputStream stream) {
		this.stream = stream;
	}

	public int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int nextInt() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return isWhitespace(c);
	}

	public static boolean isWhitespace(int c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}

class OutputWriter {
	private final PrintWriter writer;

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}

	public OutputWriter(Writer writer) {
		this.writer = new PrintWriter(writer);
	}

	public void print(Object... objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	}

	public void println(Object... objects) {
		print(objects);
		writer.println();
	}

	public void close() {
		writer.close();
	}

	}