#448 div2 a Pizza Separation

最新推荐文章于 2020-05-17 16:03:03 发布

好想吃鱼的张旭

最新推荐文章于 2020-05-17 16:03:03 发布

阅读量503

点赞数 1

CC 4.0 BY-SA版权

分类专栏：日常日记学习总结

本文链接：https://blog.youkuaiyun.com/weixin_39539882/article/details/78647739

日常日记同时被 2 个专栏收录

5 篇文章

订阅专栏

学习总结

4 篇文章

订阅专栏

探讨了两个学生如何将切好的圆形比萨分成两部分，使得这两部分的角度之差最小的问题。通过循环遍历每一片比萨并计算连续部分的总角度，找到最优解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A. Pizza Separation
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th piece is a sector of angle equal to ai. Vasya and Petya want to divide all pieces of pizza into two continuous sectors in such way that the difference between angles of these sectors is minimal. Sector angle is sum of angles of all pieces in it. Pay attention, that one of sectors can be empty.

Input
The first line contains one integer n (1 ≤ n ≤ 360) — the number of pieces into which the delivered pizza was cut.

The second line contains n integers ai (1 ≤ ai ≤ 360) — the angles of the sectors into which the pizza was cut. The sum of all ai is 360.

Output
Print one integer — the minimal difference between angles of sectors that will go to Vasya and Petya.

Examples
input
4
90 90 90 90
output
0
input
3
100 100 160
output
40
input
1
360
output
360
input
4
170 30 150 10
output
0
Note
In first sample Vasya can take 1 and 2 pieces, Petya can take 3 and 4 pieces. Then the answer is |(90 + 90) - (90 + 90)| = 0.

In third sample there is only one piece of pizza that can be taken by only one from Vasya and Petya. So the answer is |360 - 0| = 360.

In fourth sample Vasya can take 1 and 4 pieces, then Petya will take 2 and 3 pieces. So the answer is |(170 + 10) - (30 + 150)| = 0.

Picture explaning fourth sample:

Both red and green sectors consist of two adjacent pieces of pizza. So Vasya can take green sector, then Petya will take red sector.

思路：一开始以为扇形是可以离散取得所以绕了很多弯路，后来发现可以连续的话其实就很简单了，用一个取余运算就可以循环加度数了。

代码：

#include <iostream>
#include <math.h>
using namespace std;

int main(){
    int ans=361;
    int sector[361];//扇形数组
    int numberOfSector;//扇形个数
    cin>>numberOfSector;
    for(int i=0;i<numberOfSector;i++){
        cin>>sector[i];
    } 
    for(int i=0;i<numberOfSector;i++){
        int temp=0;//临时存放当前扇形度数和
        for(int j=0;j<numberOfSector;j++){
            temp+=sector[(i+j)%numberOfSector];//关键步骤 
            ans=min(ans,abs(180-temp));
        } 
    }
    cout<<ans*2<<endl;

    return 0;
}