hiho week 173 register

Ended

Participants:314

Verdict:Accepted
Score:100 / 100
Submitted:2017-10-21 22:20:18

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
#define frp(i,a,b) for(int i = (a); i<=(b); i++)
#define frd(i,a,b) for(int i = (a); i>=(b); i--)
#define clr(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define pb push_back
#define ft first
#define sd second
#define ub upper_bound
#define lb lower_bound
int n,a[1100],f[1100][1100],s[1100];
inline void get_ready( )
{
    scanf("%d", &n);
    s[0] = 0;
    clr(f,0);
    frp(i,1,n){
       scanf("%d", &a[i]);
       s[i] = s[i-1]+a[i];
       f[i][i] = a[i];
    }
}
inline void solve( )
{
    frp(i,1,n-1)
    {
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX