zoukankan      html  css  js  c++  java
  • ZOJ 3932 Handshakes

    Last week, n students participated in the annual programming contest of Marjar University. Students are labeled from 1 to n. They came to the competition area one by one, one after another in the increasing order of their label. Each of them went in, and before sitting down at his desk, was greeted by his/her friends who were present in the room by shaking hands.

    For each student, you are given the number of students who he/she shook hands with when he/she came in the area. For each student, you need to find the maximum number of friends he/she could possibly have. For the sake of simplicity, you just need to print the maximum value of the n numbers described in the previous line.

    Input

    There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

    The first line contains an integer n (1 ≤ n ≤ 100000) – the number of students. The next line contains n integers a1, a2, …, an (0 ≤ ai < i), where ai is the number of students who the i-th student shook hands with when he/she came in the area.

    Output

    For each test case, output an integer denoting the answer.

    Sample Input

    2
    3
    0 1 1
    5
    0 0 1 1 1
    Sample Output

    2
    3

    #include <iostream>
    #include <string.h>
    #include <stdio.h>
    #include <algorithm>
    #include <math.h>
    #include <stdlib.h>
    
    using namespace std;
    #define MAX 100000
    long long int a[MAX+5];
    long long int s[MAX+5];
    long long int b[MAX+5];
    int t;
    int n;
    long long int sum;
    int main()
    {
        while(scanf("%d",&t)!=EOF)
        {
            while(t--)
            {
                scanf("%d",&n);
                sum=0;s[0]=0;
                //memset(b,0,sizeof(b));
                for(int i=1;i<=n;i++)
                {
    
                     scanf("%lld",&a[i]);
                     if(a[i]>=1)
                         b[i]=1;
                     else
                         b[i]=0;
                     s[i]=s[i-1]+b[i];
    
                }
                for(int i=1;i<=n;i++)
                {
                    sum=max(sum,s[n]-s[i]+a[i]);
                }
                printf("%lld
    ",sum);
            }
        }
        return 0;
    }
  • 相关阅读:
    React Native Android打包apk
    React-Native新列表组件FlatList和SectionList学习 | | 联动列表实现
    使用react native制作的微博客户端
    Shell 脚本中 '$' 符号的多种用法
    Shell编程 | 脚本参数与交互及常见问题
    Shell编程-条件测试 | 基础篇
    Shell编程-控制结构 | 基础篇
    Python运维中20个常用的库和模块
    20款开发运维必备的顶级工具
    Linux 系统结构详解
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228728.html
Copyright © 2011-2022 走看看