Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <algorithm>
const int kN = 100 + 5;
int n, a[2][kN];
int f[2][kN];
int main()
{
scanf("%d", &n);
for (int i = 0; i < 2; ++ i) {
for (int j = 0; j < n; ++ j)
scanf("%d", &a[i][j]);
}
f[0][0] = a[0][0];
for (int j = 0; j < n; ++ j) {
... | 262 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> veci;
typedef pair<int,int> pii;
typedef vector<pii> vecii;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vecl;
typedef vector<pll> vecll;
#define EPS (1e-9)
#define MOD (1e9+7)
#define fi first
#define se second
#define endl '\n'
i... | 278 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
const int N=1e6+6;
ll arr[3][N],dp[3][N];
int main()
{
ll n;cin>>n;
for(int i=1;i<=2;i++)
{
for(int j=1;j<=n;j++)
cin>>arr[i][j];
}
//dp[1][1]=arr[1][1];
for(int i=1;i<=2;i++)
{
for(int j=1... | 269 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int n,m;
cin>>n;
int A[2][n],S1[n],S2[n];
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
cin>>A[i][j];
}
}
S1[0]=A[0][0];
S2[0]=A[1][0];
for(int i=1;i<n;i++){
S1[i]=A[0][i]+S1[i-1];
S2[i]=A[1][i]+S2[... | 212 |
Project_CodeNet | 2,018 | #include "iostream"
#include "algorithm"
#include "string"
#include "vector"
#include "cmath"
#include "bitset"
#define lp(n) for (int i = 0; i < n; i++)
#define lop(n,i) for (int i = 0; i < n; i++)
#define mod 1000000007
#define ll long long int
#define sp ' '
#define intmax 2147483647
#define intmin -2147483647
#defi... | 249 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=(... | 302 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | 374 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
using ll = long long; using pii = pair<int, int>;
const int MOD = (int)1e9 + 7, INF = (1 << 27); const ll INFLL = (1LL << 55);
#define FOR(i,a,b) for(int (i)=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
template<typename T, typename U> inline void chmax(T &x, U y) { if (... | 343 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n;
int a[1000][1000];
int main(){
scanf("%d",&n);
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for(int i=n-1;i>=1;i--)
a[2][i]+=a[2][i+1];
a[1][n]+=a[2][n];
for(int i=n-1;i>=1;i--)
a[1][i]+=max(a[2][i],a[1][i+1]);
cout<<a[1][1];
... | 146 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int A[2][100];
int sum[2][102];
int main(){
int N;
cin >> N ;
for(int i=0;i<2;++i){
for(int j=0;j<N;++j){
cin >> A[i][j];
sum[i][j+1] += sum[i][j] + A[i][j];
}
}
int max_c = 0;
for(int i=1;i<N+1;++i){
int c = sum[0][i] + sum[1][N] - sum[1][i... | 160 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#defin... | 385 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
long long int N, A[3][101] = {}, sum[3][101] = {}, ans = 0;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[1][i];
sum[1][i] = sum[1][i - 1] + A[1][i];
}
for (int i = 1; i <= N; i++) {
cin >> A[2][i];
sum[2][i]= sum[2][i - 1] + ... | 198 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
int main() {
int n; cin >> n;
vector<vector<int>> a(2, vector<int>(n));
for (auto &ai: a) for (int &aij: ai) cin >> aij;
vector<ve... | 229 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define maxn 110
using namespace std;
int a[3][maxn], dp[3][maxn];
typedef long long LL;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= 2; ++i) {
for (int j = 1; j <= n; ++j) scanf("%d", &a[i][j]);
}
for (int i = 1; i <= n; ++i) dp[1][i] = dp[1][i-1] + a[1... | 240 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int noNum ;
int v1 [N] , v2[N] ;
int main(){
scanf("%d",&noNum);
for ( int i = 1 ; i <= noNum ; i++ ){
int x ;
scanf("%d",&x);
v1 [ i ] = x ;
v1 [ i ] += v1 [ i - 1 ] ;
}
for ( int i = 1 ; i <= noNu... | 226 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
int a[2][105],f[2][105];
int main() {
#ifdef CX_TEST
freopen("E:\\program--GG\\test_in.txt", "r", stdin);
#endif
int n,i,j;
sc... | 287 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int32_t n;
cin >> n;
int32_t a[n];
int32_t b[n];
for (int32_t i = 0; i < n; i++) {
cin >> a[i];
}
int32_t s = a[0];
for (int32_t i = 0; i < n; i++) {
cin >> b[i];
s += b[i];
}
int32_t m = s;
for ... | 174 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a); i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#defi... | 1,020 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define debug(x) cout << #x << " = " << x << endl
#define fori(i, ini, lim) for(int i = int(ini); i < int(lim); i++)
#define ford(i, ini, lim) for(int i = int(ini); i >= int(lim); i--)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
const int MA... | 255 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) static_cast<int>((x).size())
using LL = long long;
template<class T, size_t D>
struct vec : vector<vec<T, D - 1>> {
template<class... Args>
vec(size_t n = 0, Args... args)
: vector<vec<T, D - 1>>(n, vec<T, D - 1>... | 520 |
Project_CodeNet | 2,018 | #include <stdio.h>
#define TWO 2
int getMostCandies (int N, int **matrix) {
int max = 0;
for (int i=0; i < N; i++) {
int sum = 0;
for (int j=0; j <= i; j++) {
sum += matrix[0][j];
}
for (int j=i; j < N; j++) {
sum += matrix[1][j];
}
if (s... | 313 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
using namespace std;
typedef long long ll;
ll const inf = 1e9;
ll const mod = 1e9 + 7;
int main()
{
int n;
cin >> n;
int a[n];
int b[n];
fr(i, 0, n) cin >> a[i];
... | 214 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000007;
const long ... | 305 |
Project_CodeNet | 2,018 | /**
*
* Author: MARS
* Lang: GNU C++14
*
**/
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ii pair < int , int >
#define LS pair < ll , string >
typedef unsigned long long ull;
typedef long double ldbl;
typedef long long ll;
typedef double dbl;
const ldbl E = 2.71828182845904... | 314 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | 476 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, s, n) for(int i = s;i < (n);i++)
#define VSORT(v) sort(v.begin(), v.end());
#define int64 long long
#define pb(a) push_back(a)
#define REP64(i, s, n) for(int64 i = s;i < (n);i++)
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typed... | 446 |
Project_CodeNet | 2,018 | /* --- author: dxm --- */
#include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define Inf 1e18
#define rep(i,n) for(int (i)=0;(i)<n;i++)
#define REP(i,n) for(int (i)=1;(i)<=n;i++)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
typedef long long ll;
inline void Fail(){printf("0");exit(0);}... | 272 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<utility>
#include<set>
#include<unordered_map>
typedef long long int ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for... | 368 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int maxn = 100009;
int a[maxn], b[maxn], n, ans, sum;
int main() {
scanf("%d", &n);
for (int i=1; i<=n; i++) scanf("%d", &a[i]);
for (int i=1; i<=n; i++) scanf("%d", &b[i]);
for (int i=1; i<=n; i++) {
sum = 0;
for (int j=1; j<=i; j++)
sum += a[j];
for (i... | 166 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip> // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple> // get<n>(xxx)
#include <queue>
#include <stack>
#include <... | 555 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main ()
{
int a[105][2],b[105][2],s1=0,s2=0,m=0,t,c=0,i,z;
cin >> t;
for(i=0;i<t;i++)
{
cin >> a[i][0];
s1=s1+a[i][0];
a[i][1]=s1;
}
for(i=0;i<t;i++)
{
cin >> b[i][0];
s2=s2+b[i][0];
b[i][1]=s2;
}... | 224 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cassert>
// #include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
// #include <random>
#include <set>
#include <stack>
#include <string>
#include ... | 416 |
Project_CodeNet | 2,020 | const int N = 4e5;
const int LG = 21;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>
using namespace std;... | 984 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | 702 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, candy = 0, maxim, p1 = 0, p2;
cin >> n;
int a[2][n];
for (int i = 0; i < 2; i++){
for (int j = 0; j < n; j++){
cin >> a[i][j];
}
}
for (int i = 1; i < n; i++){
p1 += a[0][i];
}
maxim = p1... | 243 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
using namespace std;
int a[200];
int b[200];
int c[200];
int main()
{
int N;
while(scanf("%d",&N)!=EOF)
{
for(int i=0; i<N; i++)
scanf("%d",&a[i]);
for(int i=0; i<N; i++)
scanf("%d",&b[i]);
int min1=0;
int a1,b1;
... | 207 |
Project_CodeNet | 2,019 | #define LOCAL
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <vector>
#include <numeric>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <sstream>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#... | 577 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define mod 998244353
using namespace std;
inline int read()
{int x=0,f=0;
char c=getchar();
while (c<'0'||c>'9')
{if (c=='-') f=1;
c=getchar();
}
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
if (f) x=-x;
return x;
}
int a[3][100005],n;
int dp[3][100005];
int main (){
int i,j,k;
n=read()... | 270 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define EPS (1e-7)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
int vx[]={0,0,-1,1};
int vy... | 305 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forn(i, n) for (ll i = 0; i < (ll) n; ++i)
#define sz(a) static_cast<int>(a.size())
char buff[(int) 2e6+ 17];
const ll inf = (ll) 1e9 + 7ll;
const int maxn = (int) 2e5 + 17;
int n;
int a[2][maxn];
bool read() {
if (scanf("%d", &n) != 1... | 320 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define REPS(i,n) for(int i=1; i<=(int)(n); i++)
//#define A... | 661 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 100010;
int g[2][N], dp[2][N];
int n;
int solve (int i, in... | 257 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##_end=(b);i<=i##_end;++i)
#define For(i,a,b) for(int i=(a),i##_end=(b);i<i##_end;++i)
#define per(i,a,b) for(int i=(b),i##_st=(a);i>=i##_st;--i)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define dbg(x) cer... | 338 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <utility>
#include <algorithm>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <functional>
#include <stdlib.h>
#include <climits>
#include <iomanip>
#include <complex>
#include <cmath>
using namespace std;
... | 316 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a1(n), a2(n);
for(int i=0;i<n;i++)
cin >> a1[i];
for(int i=0;i<n;i++)
cin >> a2[i];
for(int i=1;i<n;i++) {
a1[i] += a1[i-1];
a2[i] += a... | 221 |
Project_CodeNet | 2,018 | /// In The Name Of God
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.beg... | 451 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <sstream>
#include <bitset>
#include <climits>
#include <iterator>
#include <set>
#include <iomanip>
#define ll long long
#define mod 1000000007
using names... | 359 |
Project_CodeNet | 2,018 | #include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end(... | 355 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int a[105],b[105];
int main()
{
int n;
cin >> n;
for(int i=0;i<n;i++) cin >> a[i];
for(int j=0;j<n;j++) cin >> b[j];
for(int i=1;i<n;i++) a[i] += a[i-1];
for(int i=n-2;i>=0;i--) b[i] += b[i+1];
int ans = 0;
for(int i=0;i<n;i++){
ans = max(ans,a[i]+b[i]);
}
cout << ... | 133 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <string>
#include <cstring>
#include <ctime>
#include <cassert>
#include <queue>
#include <stack>
#include <bitset>
#include <iomanip>
#define y1 y11
#define sc second
#define fr first
... | 410 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using f64 = double;
using i64 = long long;
using pii = pair<int, int>;
const int N = 105;
int n;
int dp[3][N];
int main() {
#ifdef HOME
freopen("arc.in", "r", stdin);
freopen("arc.out", "w", stdout);
#endif
ios::sync_with_stdio(fals... | 233 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iomanip>
#include <istream>
#include <map>
#include <numeric>
#include <ostream>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
class Solution {
public:
int a[2][100];
void solve(std::istream& in, std::ostream& out) {
... | 359 |
Project_CodeNet | 2,018 | #ifndef LOCAL
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
typedef long long ll;
typedef long long llong;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
/*
ll pw(ll a, ll b) {
ll ans = 1; while (b) {
while (!(b & 1)) b >>= 1, a = (a * a) % MOD;
ans = (ans * a) % MOD, ... | 303 |
Project_CodeNet | 2,018 | #include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#incl... | 415 |
Project_CodeNet | 2,018 | //#include <fstream>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
//ifstream cin("x.in"); ofstream cout("x.out");
const int nmax = 100;
int v[ 2 ][nmax + 1];
int main() {
int n;
cin >> n;
for (int i = 1; i <= 2; ++ i) {
for (int j = 1; j <= ... | 220 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#in... | 1,047 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sqr(x) ((x) * (x))
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define TRACE(x) cout... | 371 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
template<typename T>
void read(T &ans){T f = 1; char c = getchar();ans = 0;while(!isdigit(c)){if(c == '-')f = -1;c = getchar();}while( isdigit(c)){ans = ans*10 + c - '0';c = getchar();}ans *= f;}
#define int long long
int n, a[5][500], sum[5][500];
signed main(){
rea... | 230 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
#include<stdio.h>
#include <cstdint>
#inclu... | 574 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void){
int N;
int A[2][100];
int B[2][100];
cin >> N;
for(int i = 0; i < N; i++){
cin >> A[0][i];
}
for(int i = 0; i < N; i++){
cin >> A[1][i];
}
B[0][0] = A[0][0];
for(int i = 1; i < N; i++){... | 290 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main(void) {
int N;
cin >> N;
vector< vector<int> > A(2, vector<int>(N+1));
for(int i=0; i<2; i++) {
for(int j=1; j<=N; j++) {
cin>> A[i][j];
}
partial_sum(A[i].be... | 174 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair< int , int > PII;
const int dirx[] = {-2,-1,1,2, 1, -1};
const int diry[] = {0,1,1,0, -1, -1};
inline void debugMode() {
#ifndef ONLINE_JUDGE
freopen... | 304 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < int(n); ++ (i))
#define ALL(x) begin(x), end(x)
using namespace std;
template <class T> inline void chmax(T & a, T const & b) { a = max(a, b); }
int main() {
// input
int n; cin >> n;
vector<int> a0(n); REP (i, n) cin >> a0[i];
vector<int... | 249 |
Project_CodeNet | 2,018 | #include<cstdio>
int a[105],n,b[105];
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d",&a[i]),a[i]+=a[i-1];
for (int i=1;i<=n;i++) scanf("%d",&b[i]);
int ans=0;
for (int i=n;i>=1;i--)
{
b[i]+=b[i+1];
if (b[i]+a[i]>ans) ans=a[i]+b[i];
}
printf("%d\n",ans);
return 0;
}
| 127 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, i;
cin>>n;
vector<int> top(n), bot(n);
for (i = 0; i < n; ++i)
{
cin>>top[i];
if (i)
top[i] += top[i - 1];
}
for (i = 0; i < n; ++i)
{
cin>>bot[i];
if (i && bot[i - 1] > top... | 159 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define ff first
#define ss second
#define nl '\n'
//////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); srand(time(0));
int n;
cin >> n;
int a[2][n... | 304 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MEM(n, val) memset(n, val, sizeof(n))
#define FOR(i, j, k) for(int i = j; i <= k; i++)
#define ROF(i, j, k) for(int i = j; i >= k; i--)
#define LL long long
#define F first
#define S second
#define PII pair<int, int>
#define INF 1999999999
#def... | 437 |
Project_CodeNet | 2,020 | #include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <iomanip>
typedef long double ld;
type... | 724 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a[2][100],sum=0,ans=0;
cin>>n;
for(int i=0;i<2;i++)
for(int j=0;j<n;j++)
cin>>a[i][j];
for(int i=0;i<n;i++)
sum+=a[1][i];
sum+=a[0][0];
ans=sum;
for(int i=1;i<n;i++){
sum-=a[1][i-1];
sum+=a[0][i];
ans=max(ans,sum);
}
cout<<ans<<endl;
}... | 134 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr first
#define sc second
#define ll long long
#define mp make_pair
#define mod 1000000007
using namespace std;
int n;
ll a[2][10010];
ll dp[2][10010];
ll f(int i,int j){
if(i == 1 && j== n-1){
return a[i][j];
}
if... | 245 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a1(n), a2(n);
for(int i = 0; i < n; ++i){ cin >> a1[i]; }
for(int i = 0; i < n; ++i){ cin >> a2[i]; }
for(int i = 1; i < n; ++i){ a1[i] +=... | 197 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n+1;i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end())
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n;
cin >> n;
vector<vector<int>> dp(3,v... | 195 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll... | 338 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll=int64_t;
#define int ll
#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define ALL(x) x.begin(),x.end()
#define REACH cerr<<"reached line "<<__LINE__<<endl
#define DMP(x) cerr<<"line "<<__LI... | 539 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int>> a(2,vector<int>(n));
for(int i=0;i<2;i++)
for(int j=0;j<n;j++)
cin>>a.at(i).at(j);
vector<vector<int>> c(2,vector<int>(n,0));
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
c[i][j]=(j==0?a.at(i).at(j... | 182 |
Project_CodeNet | 2,018 | /** By @ZhakudaMagzhan **/
/*
# pragma comment(linker, "/stack:20000000")
# pragma GCC optimize("Ofast,no-stack-protector")
# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx") // */
# include <bits/stdc++.h>
# define fi first
# define se second
# define y1 WENAO
# define endl "\n"
# define ioi ex... | 768 |
Project_CodeNet | 2,018 | //Code by 27.
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<math.h>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<fstream>
#include<stdlib.h>
#include<set>
#include<climits>
#include<cmath>
#include<memory.h>
#include<sstream>
#include<time.h>
using names... | 1,448 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(int i=(int)(st),i##end=(int)(ed);i<=i##end;++i)
#define DREP(i,st,ed) for(int i=(int)(st),i##end=(int)(ed);i>=i##end;--i)
template<typename T>bool chkmin(T &x,const T &y){return x>y?x=y,1:0;}
template<typename T>bool chkmax(T &x,const T &y){return x<... | 434 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N;
cin >> N;
vector<vector<ll>> A(2, vector<ll>(N));
for ( int i = 0; i < 2; i++ ) {
for ( int j = 0; j < N; j++ ) {
cin >> A[i][j];
}
}
vector<ll> AL(N), AR(N);
for ( int i = 0; ... | 275 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pair;
const int Nmax = 2e5 + 5, Mod = 1e9 + 7;
int n, i, j, a[105][105], dp[105][105];
int main()
{
cin.sync_with_stdio(false);
cin >> n;
for(i=1; i<=2; ++i)
for(j=1; j<=n; ++j)
cin >> a[i][j];... | 188 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector <int> ar1(n);
vector <int> ar2(n);
for (int i = 0; i < n; ++i) {
cin >> ar1[i];
}
for (int i = 0; i < n; ++i) {
cin >> ar2[i];
}
int ans = 0;
for (int d = 0; d < n; ++d) {
int ... | 196 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n; cin >> n;
ll a[2][n];
for(ll j = 0; j < 2; j++)for(ll i = 0; i < n; i++) cin >> a[j][i];
ll ue[n + 1] = {}, sita[n + 1] = {};
for(ll i = 0; i < n; i++){
ue[i + 1] = ue[i] + a[0][i];
sita[i + 1] = sita[i] + a[1][i];
}
ll sum ... | 190 |
Project_CodeNet | 2,018 | /*
ЗАПУСКАЕМ ВЫСОКОГО
░ГУСЯ░▄▀▀▀▄░РАБОТЯГИ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░... | 1,697 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rept(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define reps(i,s,n) for(int (i)=(s);(i)<(int)(n);(i)++)
#define repst(i,s,n) for(int (i)=(s);(i)<=(int)(n);(i)++)
#define repr(i,n) for(int (i)=(... | 736 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(register int i=st,i##end=ed;i<=i##end;++i)
#define DREP(i,st,ed) for(register int i=st,i##end=ed;i>=i##end;--i)
typedef long long ll;
inline int read(){
int x;
char c;
int f=1;
while((c=getchar())!='-' && (c>'9' || c<'0'));
if(c=='-') c=getchar(... | 430 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstring>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <algorithm>
#include <functional>
#include <iomanip>
using namesp... | 260 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int N;
int A[2][101];
int main(){
cin >> N;
A[0][0] = A[1][0] = 0;
for(int i = 0; i < N; ++i){
cin >> A[0][i+1];
}
for(int i = 0; i < N; ++i){
cin >> A[1][i+1];
}
for(int i = 1; i <= N; ++i){
A[0][i] += A[0][i-1];
A[1... | 221 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a[2][101];
int n, x, maxi = -1;
void dfs( int x, int y, int tot ){
tot += a[x][y];
if( y == n-1 ){
if( x == 1){
maxi = max(maxi, tot);
} else {
dfs(1, y, tot);
}
return;
}
if( x == 0 ){
dfs(1, y, tot);
}
dfs(x, y+1, tot);
}
int main(){
cin >> n... | 196 |
Project_CodeNet | 2,018 | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define mod(x) ((x % MOD) + MOD) % MOD
#define int long long int
#de... | 334 |
Project_CodeNet | 2,018 | //ΔARC090A
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
int n,a[111][111];
int main()
{
int i,j;
cin>>n;
for(i=1;... | 149 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int n, a[2][1000], sum[2][1000];
int ans;
int main(){
scanf("%d", &n);
for(int i = 0; i < 2; ++i)
for(int j = 0; j < n; ++j){
scanf("%d", &a[i][j]);
sum[i][j] = a[i][j] + ((j == 0) ? 0 : sum[i][j-1]);
}
for(int i = 0; i < n; ++i){
ans = max(ans, sum[0][i] + su... | 178 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod=1e9+7;
ll inf=1e10;
int main(){
int N,A[2][100];
cin>>N;
for (int i(0);i<N;i++) cin>>A[0][i];
for (int i(0);i<N;i++) cin>>A[1][i];
int ans(0);
for (int i(0);i<N;i++){
int cnt(0);
for (int j(0);j<N;j++){
if (j<=i) cnt +... | 181 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> A(2, vector<int>(n)), dp = A;
for (auto &vec: A) {
for (int &x: vec) {
scanf("%d", &x);
}
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
dp[i][j] = A[i][j] + max(i ? dp[i - 1][j] : 0... | 177 |
Project_CodeNet | 2,018 | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int a[5][105],f[5][105];
inline int read()
{
char ch=getchar(),la;
while (ch<'0' || ch>'9') la=ch,ch=getchar();
int ans=0;
while (ch<='9' && ch>='0')
{
ans=ans*10+ch-48;
ch=getchar();
}
if (la=='-')... | 268 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define PN printf("\n")
#define MODV 1000000007
typedef long long ll;
typedef double dbl;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pi;
template<class T>void addmod(T... | 436 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define de(x) cout<<#x<<"="<<x<<endl;
#define dd(x) cout<<#x<<"="<<x<<" ";
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define repd(i,a,b) for(int i=a;i>=(b);--i)
#define repp(i,a,b,t) for(int i=a;i<(b);i+=t)
#define ll long long
#define mt(a,b) memset(a,b,sizeof(a))
#define fi first
#define se se... | 612 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define mz 1000000007
#define pq priority_queue
int num[5][105];
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
{
scanf("%d",&num[i][j]);
num[i][j]+=max(num[i-1][j],num[i][j-1]);
... | 119 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ALL(A) (A).begin(),(A).end()
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
const ll mod = 1e9+7;
const ll INF = 2*1e18;
const int inf = 1e9+7;
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int H,W,N;
cin >> N;
H = 2;
W = N;
vector... | 304 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define __m int mid=(l+r)/2;
template<class T>
inline bool read(T &num)
{
char in;bool IsN=false;
while(in=getchar(),in!='-'&&(in<'0'||in>'9'))if(in==EOF)return false;
in=='-'?(IsN=tr... | 420 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[2][100],b[2][100];
cin >> n;
for(int i=0;i<n;i++){
cin >> a[0][i];
}
for(int i=0;i<n;i++){
cin >> a[1][i];
}
b[0][0] = a[0][0];
b[1][0] = a[0][0] + a[1][0];
for(int i=1;i<n;i++){
b[0][i] = b[0][i-1]+a[0][i];
b[1]... | 192 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.