贪心 Codeforces Round #191 (Div. 2) A. Flipping Game

题目传送门

 /*
     贪心：暴力贪心水水
 */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 using namespace std;

 const int MAXN = 1e2 + ;
 const int INF = 0x3f3f3f3f;
 int a[MAXN];

 int main(void)      //Codeforces Round #191 (Div. 2) A. Flipping Game
 {
     int n;    scanf ("%d", &n);
     int sum = ;
     for (int i=; i<=n; ++i)    scanf ("%d", &a[i]), sum += a[i];

     int ans = ;
     for (int i=; i<=n; ++i)
     {
         for (int j=; j<=n-i+; ++j)
         {
             int pre = ;    int now = ;
             for (int k=j; k<=j+i-; ++k)
             {
                 pre += a[k];    now +=  - a[k];
             }
             ans = max (ans, sum - pre + now);
         }
     }

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

     return ;
 }