hdu 5328 Problem Killer 2015 Multi-University Training Contest 4

最新推荐文章于 2020-07-04 10:13:06 发布

I-Hsin

最新推荐文章于 2020-07-04 10:13:06 发布

阅读量413

点赞数

文章标签： acm MUTC brute force

本文链接：https://blog.csdn.net/ihsin/article/details/47980941

版权

直接计算相邻两数的差和商即可，我开始还思忖这a[i]=0怎么处理商，后来发现a[i]>=1。在统计连续的相同的差和商的同时和ans比较并保存即可。我多此一举存在了vector里，不过影响不大，TLE了好久是因为多了几个memset==

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<stdlib.h>
#include<vector>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<ctype.h>
#include<map>
#include<time.h>
#include<bitset>
#include<set>
#include<list>
using namespace std;
//hdu 5328

const int maxn=1000010;
const double eps=1e-8;
int T;
int n;
int a[maxn];
int sub[maxn];
double divi[maxn];
vector<int>subans;
vector<double>divans;
int ans;
int main()
{
    freopen("input.txt","r",stdin);
    scanf("%d",&T);
    for(int ca=1;ca<=T;ca++)
    {
        scanf("%d",&n);
      //  memset(a,0,sizeof(a)); //lead to TLE
      //  memset(sub,0,sizeof(sub));
       // memset(divi,0,sizeof(divi));
        subans.clear();
        divans.clear();
        ans=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            sub[i]=a[i]-a[i-1];
            if(i==1) continue;
            divi[i]=(double)a[i]/(double)a[i-1];//a[0]==0?
        }
        if(n==1)
        {
            puts("1");
            continue;
        }
        if(n==2)
        {
            puts("2");
            continue;
        }
        int cnt=1;
        for(int i=3;i<=n;i++)
        {
            if(sub[i]==sub[i-1])
            {
                cnt++;
            }
            else
            {
                subans.push_back(cnt);
             //   ans=max(ans,cnt); //this is also ok.
                cnt=1;
            }
        }
        subans.push_back(cnt);
      //  ans=max(ans,cnt);
        cnt=1;
        for(int i=3;i<=n;i++)
        {
            if(fabs(divi[i]-divi[i-1])<eps)
            {
                cnt++;
            }
            else
            {
                divans.push_back(cnt);
              //  ans=max(ans,cnt);
                cnt=1;
            }
        }
        divans.push_back(cnt);
      //  ans=max(ans,cnt);
        for(int i=0;i<subans.size();i++)
        {
            if(ans<subans[i])
            {
                ans=subans[i];
            }
        }
        for(int i=0;i<divans.size();i++)
        {
            if(ans<divans[i])
            {
                ans=divans[i];
            }
        }
        printf("%d\n",ans+1);
    }
    return 0;
}