Segments CodeForces 909B （找规律）

Description

You are given an integer N. Consider all possible segments （线段，划分）on the coordinate axis with endpoints at integer points with coordinates between 0 and N, inclusive; there will be of them.

You want to draw these segments in several layers so that in each layer the segments don't overlap（重叠） (they might touch at the endpoints though). You can not move the segments to a different location on the coordinate axis.

Find the minimal number of layers（层次） you have to use for the given N.

Input

The only input line contains a single integer N (1 ≤ N ≤ 100).

Output

Output a single integer - the minimal number of layers required to draw the segments for the given N.

Sample Input

Input

Output

Input

Output

Input

Output

Hint

As an example, here are the segments and their optimal arrangement（最优排列） into layers for N = 4.

题目意思；给你一条n长的线段，我们可以将其划分为n*（n+1）/2个子线段。现在要求子线段在坐标轴上的位置不动，将所有的子串进行压缩，不能出现重叠，问最少能够得到几层原n长的线段。

解题思路：当时是我队友搞的这道题，我一向对找规律的题目很头疼，他就是一一枚举发现的规律。

 #include <stdio.h>

 using namespace std;

 int main()

 {

     int n,k,i,a[];

     a[]=;

     a[]=;

     a[]=;

     for(i=;i<=;i++)

     {

         k=i*(i+)/;///总的子线段数

         a[i]=k-a[i-];

     }

     while(~scanf("%d",&n))

     {

         printf("%d\n",a[n]);

     }

     return ;

 }

但其实也可以这样想，最后得到的层次数是原来长度为n的线段的若干条可能还会有部分，又因为每一层的线段都是子串在坐标轴上不动拼接得来的，那么我们将线段分成一个个的坐标上的点，那么出现次数最多的那个点的次数就是层次数！！！

 #include<stdio.h>

 #include<algorithm>

 using namespace std;

 int vis[];

 int main()

 {

     int n,j,i,k,ans;

     ans=;

     scanf("%d",&n);

     for(i=; i<=n; i++)

     {

         for(j=i; j<=n; j++)///划分子段

         {

             for(k=i; k<=j; k++)///将子段拆成一个个的点

             {

                 vis[k]++;

             }

         }

     }

     for(i=; i<=; i++)

     {

         ans=max(ans,vis[i]);

     }

     printf("%d\n",ans);

     return ;

 }

巴特西

Segments CodeForces 909B （找规律）

最新文章

热门文章