Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int N;
int A[2][102];
int cc[2][102];
int dp(int r, int c) {
int &ret = cc[r][c];
if(ret != -1) return ret;
if(r == 1 && c == N - 1) return ret = 0;
ret = 0;
if(r == 0) ret = max(ret, A[r + 1][c] + dp(r + 1, c));
if(c != N - 1) ret = max(ret, A[r][... | 235 |
Project_CodeNet | 2,018 | #include <stdio.h>
#define ARC(i,a,b) for(int i=(a);i<(b);++i)
#define ARCH(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RC(i,n) ARC(i,0,n)
#define RCH(i,n) ARCH(i,n,0)
#define SRC(i,s) for(Int i=0;(s)[i];++i)
#define ATH(a,b) ((a)>(b)?(a):(b))
#define OTH(a,b) ((a)<(b)?(a):(b))
#define ANTH(a,b) {if((a)<(b))(a)=(b);}
#... | 298 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <queue>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<... | 817 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1<<30;
int main(){
int n;cin>>n;
vector<int> a(n), b(n);
for(auto &e: a)cin>>e;
for(auto &e: b)cin>>e;
int ans=-INF;
for(int i=0;i<n;i++){
int count=0;
for(int j=0;j<=i;j++){
count += a[j];
}
for(in... | 146 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
// Custom Header {{{
#define ALL(x) x.begin(), x.end()
#define rep(i, s, n) for(int i(s); i < int(n); ++i)
#define endl '\n'
#ifndef YDK
#define eprintf(...)
#endif
using namespace std;
using i64 = long long;
using pii = pair<i64, i64>;
template<class A, class B>inline bool chmax(A &a, con... | 406 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
// 二つの値の最大値を求める関数
Int Max(const I... | 430 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
//#define FILE
#define taskname ""
#define taski taskname".in"
#define tasko taskname".out"
typedef long long ll;
typedef unsigned int uint;
const int N = 105;
int n, a[2][N], ans;
int main()
{
ios:: sync_with_... | 273 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define dump(...) do{print_vars(cout<<"# "<<#__VA_ARGS__<<'=',__VA_ARGS__);cout<<endl;}while(0)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) beg... | 724 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<vector<int> > A;
for(int i = 0; i < 2; ++i) {
vector<int> v;
for(int j = 0; j < N; ++j) {
int a;
cin >> a;
v.push_back(a);
}
A.push_back(v);
}
int result = 0;
for(int k = 0; k < N; ++k) {
int s = 0;
for(... | 226 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> table(2,vector<int>(n));
for(int i=0;i<2;i++)for(int j=0;j<n;j++)cin >> table.at(i).at(j);
int high = 0,low = 0;
for(int i=0;i<n;i++){
high += table.at(0).at(i);
low = max(low,high)+table.at(1).at(i);
... | 140 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <cctype>
#include <ctime>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#inclu... | 375 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int a[3][105],dp[3][105];
int main()
{
int n;
cin>>n;
for (int i=1;i<=2;i++)
{
for (int j=1;j<=n;j++) cin>>a[i][j];
}
dp[1][1]=a[1][1];
for (int i=1;i<=2;i++)
{
for (int j=1;j<=n;j++)
{
if (i==1&&j==1) continue;
if (i==1) dp[i][j]=dp[i][j-1]+a[i][j]... | 196 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int NMAX=100;
int candy[2][NMAX],maximum[2][NMAX],n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
cin ... | 231 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int MAXN = 2e5 + 10;
int n;
vector<vector<int>> g(2, vector<int>(105));
int dp[3][105];
int rec(int i, int j, int score){
if( i == 1 and j == n - 1) return score + g[i][j];
if( i > 1 or i < 0) return -INT_MAX;
if( j > n - 1 or j... | 341 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define null NULL
#define mp make_pair
#define pb(a) push_back(a)
#define sz(a) ((int)(a).size())
#define all(a) a.begin() , a.end()
#define fi first
#define se second
#define relaxMin(a , b) (a) = min((a),(b))
#define relaxMax(a , b) (a) = max((a),(b))
#define SQR(a) ((a)*... | 324 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <climits>
#include <cstring>
#include <functional>
using namespace std;
using ll = long long;
#define rep(i, N) for(int i = 0;i < N;i++)
#defin... | 263 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int a[3][111];
int d[3][111];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[1][i]);
for (int i = 1; i <= n; i++) scanf("%d", &a[2][i]);
for (int i = 1; i <= 2; i++)for (int j = 1; j <= n; j++) {
d[i][j] = max(d[i - 1][j]... | 167 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
constexpr int N = 101;
int n;
int A[2][N];
int C[2][N];
struct Pos{int x, y;};
int main() {
std::cin >> n;
for(int i = 0; i < n; i++) {
std::cin >> A[0][i];
}
for(int i = 0; i < n; i++) {
std::cin >> A[1][i];
}
Pos p{0,0};
C[0][0] =... | 279 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <string>
#include <cstring>
#include <vec... | 581 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int main() {
int N; cin >> N;
vector<vector<int>> A(2, vector<int>(N));
vector<vector<int>> sum(2, vector<int>(N + 1));
for(int i = 0; i < 2; ++i) {
for(int j = 0; j < N; ++j) {
cin >> A... | 196 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include <iostream>
#include <numeric>
#define ull unsigned long long
#define ll long long
#define mpa make_pair
#define pb push_back
#define ff first
#define dd float
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boost ios_base::sync_with_stdio(0)
#define forp(i,a... | 4,068 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main() {
int n;
int a[2][100];
cin >> n;
for(int i=0;i<2;i++) for(int j=0;j<n;j++) {
cin >> a[i][j];
}
int sum = a[0][0];
for(int i=0;i<n;i++) sum += a[1][i];
int max = sum;
for(int i=1;i<n;i++) {
sum += a[0][i] - a[1][i-1];
if(sum > max) max = sum;
}
cout <... | 137 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
long long m[1000][1000],dp[1000][1000];
int main()
{
long long n,i,j;
scanf("%lld",&n);
for(i=0;i<2;i++)
for(j=0;j<n;j++)
scanf("%lld",&m[i][j]);
for(i=0;i<2;i++)
for(j=0;j<n;j++)
{
if(i==0 && j==0)
dp[i][j]=m[i][j];
if(... | 238 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a1(n), a2(n), counter1(n, 0), counter2(n, 1);
for (auto & x : a1) std::cin >> x;
for (auto & x : a2) std::cin >> x;
counter1[0] = a1[0];
c... | 221 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=105;
int a[MAXN],b[MAXN];
int n;
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]);
for(int i=n-1;i>=1;i--)
b[i]+=b[i+1];
int ans=0;
fo... | 145 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int str[2][n];
int i,j;
for(i=0; i<2; i++)
for(j=0; j<n; j++)
{
scanf("%d",&str[i][j]);
}
int stu[n];
stu[0]=str[0][0];
for(i=0;i<n;i++)
stu[0]+=str[1][i];
for(i=1;i<... | 168 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define FOR(i, a, b) for(ll i = (a); i < (ll)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define YYS(x, arr) for(auto& x: arr)
#define PW(x) (1LL<<(x))
#define SZ(x) ((ll)(x).size())
#define pb empalce_back
#define fi first
#define se second
using namespace std;
using ld = long double;
using l... | 608 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[3][200],f[3][200];
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=1;i<=2;i++)
for (int j=1;j<=n;j++)
f[i][j]=a[i][j]+max(f[i][j-1],f[i-1][j]);
printf("%d\n",f[2][n]);
return 0;
} | 135 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int a[5][105];
int main()
{
int n;
cin>>n;
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
a[i][j]+=max(a[i-1][j],a[i][j-1]);
cout<<a[2][n]<<endl;
return 0;
}
| 114 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
templa... | 1,576 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a[111]={0},b[111]={0};
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
a[i]+=a[i-1];
}
for(int i=1;i<=n;i++){
cin>>b[i];
b[i]+=b[i-1];
}
int maxs=0;
for(int i=1;i<=n;i++) maxs=max(maxs,a[i]+b[n]-b[i-1]);
cout<<maxs<<endl;
retur... | 137 |
Project_CodeNet | 2,018 | // Template by [thunder_blade]
// IIIT ALLAHABAD
// includes :)
#include <bits/stdc++.h>
using namespace std;
#define TEST int test_case; cin>>test_case; while(test_case--)
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ll long long int
#def... | 499 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>... | 309 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include <cstring>
#include <iostream>
#define pie acos(-1)
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b)
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sl(a) scanf("%lld",&a)
#define sll(a,b) scanf("%lld %lld",&a,&b)
#define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,... | 1,097 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
struct P
{
//string r;
int x;
//int y;
string r;
bool operator<(const P &a)const{
// if(y!=a.y)
// return y>a.y;
return x>a.x;
// return z>a.z;
}
};
struct S
{
int x,y;
};
vector<P> v[333];
//bitset<4001000> bit;
int ... | 452 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S ... | 224 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N = 200;
int n, a[N], b[N], f1[N], f2[N];
int main()
{
memset( f1, 0, sizeof( f1 ) );
memset( f2, 0, sizeof( f2 ) );
scanf( "%d", &n );
for( int i = 1; i <= n; i ++ )
scanf( "%d", &a[i] );
for( int i = 1; i <= n; i ++ )
sca... | 222 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i > (n); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
//降順はgreater<T>()
#define all... | 747 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);++i)
typedef long long int ll;
using namespace std;
typedef pair<int, int> P;
int A[2][101];
int main(void) {
int N;
cin >> N;
REP(i, N) cin >> A[0][i];
REP(i, N) cin >> A[1][i];
F... | 233 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<functional>
#include<stack>
#include<queue>
#include<iomanip>
#include<map>
#include<limits>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<deque>
#include<utility>
#include<complex>
#include<cstdlib>
#includ... | 514 |
Project_CodeNet | 2,018 | #include <stdio.h>
int N,A[2][100];
int main()
{
scanf ("%d",&N);
for (int i=0;i<2;i++){
for (int j=0;j<N;j++){
scanf ("%d",&A[i][j]);
int p = 0;
if (i) p = A[i-1][j];
if (j) p = p < A[i][j-1] ? A[i][j-1] : p;
A[i][j] += p;
}
}
printf ("%d\n",A[1][N-1]);
return 0;
} | 135 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
int main() {
size_t N;
scanf("%zu", &N);
std::vector<int> A(N), B(N);
for (auto& ai: A) scanf("%d", &ai);
for (auto& bi: B) scanf("%d", &bi);
int res = 0;
for (size_t i = 1; i <= N; ++i) {
int a = std::accumulate(A.begin(),... | 163 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long cc;
typedef pair <int, int> pii;
#define pb push_back
#define X first
#define Y second
#define mp make_pair
const int N = 102;
int a[N], b[N], f[N], n;
int main() {
ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin >> n;
fo... | 218 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <cstdlib>
#include <climits>
//#include <stdio.h>
//#include <stdlib.h>
using namespace std;
#define debug false
int main(int argc, char *argv[]){
int N;
cin >> N;
vector<vector<int>> A(2), B(2);
A[0].res... | 331 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define TRACE(x) cerr << #x << " " << x << endl
#define eb emplace_back
#define __ << " " <<
typedef long long ll;
typedef std::pair<int, int> P;
#define X first
#define Y second
#define double long double
... | 267 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll N;
ll m[110][110];
ll dp[110][110];
memset(dp, -1, sizeof dp);
cin >> N;
for(int i = 0; i < 2; ++i){
for(int j = 0; j < N; ++j){
cin >> m[i][j];
}
}
priority_queue<pair<ll, pair<ll, ll> > > q;
q.push(pair<ll, pair<... | 333 |
Project_CodeNet | 2,018 | #include <stdio.h>
#define MAX_N 110
int a[MAX_N], b[MAX_N];
int x[MAX_N], y[MAX_N];
int main(void)
{
int n;
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++)
x[i] = x[i - 1] + a[i... | 212 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... | 574 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(){
int n,a[110][2];
cin>>n;
lol(j,2)lol(i,n)cin>>a[i][j];
int maxi=0;
lol(i,n){
int cnt=0;
lol(j,n){
if(j<=... | 151 |
Project_CodeNet | 2,018 | //By Don4ick
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
#define forn(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define y1 qwer1234
const double PI = acos(-1.0);
const int DIR = 4;
const int ... | 335 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | 463 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int A[2][105];
int ... | 271 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
int ar[2][n];
int sum1[n];
int sum2[n];
int sum[n];
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < n; j++)
{
cin >> ar[i][j];
}
}
sum1[0] = ar[0][0]... | 261 |
Project_CodeNet | 2,018 | #include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | 281 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<stack>
#include<bitset>
using namespace std;
#define ll long long
#define RG register
#define REP(i,a,b) for(int i=(a),_end_=(b);i<=_end_;i++)... | 333 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <vector>
using namespace std;
#define bll long long
#define dou double
#de... | 286 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long lo... | 499 |
Project_CodeNet | 2,018 | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define ff first
#define ss second
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define int long long
#define all(a) a.begin(), a.end()
#define ull unsigned long ... | 775 |
Project_CodeNet | 2,018 | /*
f[i][j] = max(f[i - 1][j], f[i][j - 1]) + arr[i][j]
*/
#include <iostream>
using namespace std;
int arr[5][105];
int n;
int f[5][105];
int main() {
cin >> n;
for (int i = 1; i <= 2; i ++)
for (int j = 1; j <= n; j ++)
cin >> arr[i][j];
for (int i = 1; i <= 2; i ++)
for (int j = 1; j <= n; j ++) {
i... | 199 |
Project_CodeNet | 2,018 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 2,344 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
int a[5][110];
for(int i=1;i<=n;i++)cin>>a[1][i];
for(int i=1;i<=n;i++)cin>>a[2][i];
int ans=0;
for(int i=1;i<=n;i++){
int cnt=0;
for(int j=1;j<=n;j++){
if(j<=i)cnt+=a[1][j];
if(j>=i)cnt+=a[2][j];
}... | 148 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N=105;
int d[3][N];
int m[3][N];
int n;
int main(){
scanf("%d",&n);
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
scanf("%d",&m[i][j]);
for(int i=2;i>=1;i--)
for(int j=n;j>=1;j--){
d[i][j]+=m[i][... | 171 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 1000;
int d[4][NMAX+2], v[4][NMAX+2];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
for( int i = 1; i <= 2; ++i )
for( int j = 1; j <= N; ++j )
cin >> v[i][j];
for( int j = 1; ... | 209 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <cmath>
#include <cstdlib>
#include <locale>
#include <map>
#include <functional>
#include <utility>
using namespace std;
#define MS0(I) memset(I, 0, sizeof(I));
#de... | 370 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)... | 736 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int n,a[111],b[111],s,u,d;
main()
{
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)
{
cin>>b[i];
d+=b[i];
}
for(int i=0;i<n;i++)
{
u+=a[i];
s=s<(u+d)?u+d:s;
d-=b[i];
}
cout<<s<<endl;
} | 110 |
Project_CodeNet | 2,018 |
#include <bits/stdc++.h>
using namespace std;
int a[3][110];
int dp[3][110];
int dx[] = {1, 0};
int dy[] = {0, 1};
int res;
int n;
bool go(int x, int y){ return x >= 0 && x < 3 && y >= 0 && y < n; }
void dfs(int x, int y, int ret){
if(x == 2 && y == n - 1){
res = max(res, ret);
return ;
}
... | 317 |
Project_CodeNet | 2,018 | /*"Nothing is true."*/
#include<bits/stdc++.h>
using namespace std;
inline int min(int _a, int _b) {return _a < _b ? _a : _b;}
inline int max(int _a, int _b) {return _a > _b ? _a : _b;}
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
template <class _T> inline void rd(_T &_a) {
int _f=0,_ch=getchar();_a=0;
whil... | 381 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,a[2][111];
int main(){
scanf("%d",&n);
for(int i=0; i<2; i++){
for(int j=0; j<n; j++){
scanf("%d",&a[i][j]);
a[i][j] += max(i>0?a[i-1][j]:0, j>0?a[i][j-1]:0);
}
}
printf("%d\n",a[1][n-1]);
return 0;
}
| 116 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <map>
#include <utility>
#include <set>
#include <list>
#include <climits>
using namespace std;
#define CL(a, b) memset(a, b,... | 435 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<deque>
#include<functional>
#include<ctime>
#include<cassert>
using namespace std;
#define sz(x) (int)(x.size())
#define fi(a,b) for(int i=a;i<b;++i)
#define fj(a,b) for(int j=a;j<b;++j)
#def... | 481 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int N;
vector<int> first_sum;
vector<int> second_sum;
int main() {
cin >> N;
int num;
for(int i = 0; i < N; i++) {
cin >> num;
first_sum.push_back(num);
if (i > 0) {
first_sum[i] += first_sum[i-1];
}
}
for(int i = 0; i < N... | 243 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cctype>
#include<queue>
#include<cstdio>
#include<cmath>
#include<sstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
#include<ctime>
#include<cstdlib>
#include<map>
#include<utility>
#include<iomanip>
#include<set>
#include<stack>
//#include<Windows.h>
using nam... | 306 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 100
using namespace std;
int n;
int d[3][MAXN+5];
int main()
{
scanf("%d",&n);
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
scanf("%d",&d[i][j]);
for(int i=1;i<=n;i++)
d[1][i]+=d[1][i-1];
for(int i=1;i<=n;i+... | 148 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
const int N = 100 + 5;
int dp[5][N], a[5][N], n;
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 j = 1; j <= n; j++) {
for(int i = 1; i <= 2; i++) {
dp[i][j] = max(... | 175 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
int N;
int A[2][100];
scanf("%d",&N);
for(int i=0;i<N;i++) scanf("%d", &A[0][i]);
for(int i=0;i<N;i++) scanf("%d", &A[1][i]);
int ans = 0;
for(int i=0;i<N;i++){
int tmp = 0;
for(in... | 173 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | 308 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int n, tu[3][101];
int dp[3][101];
int main(){
cin>>n;
for(int i = 1; i <= 2; i++){
for(int j = 1; j <= n; j++){
cin>>tu[i][j];
}
}
dp[1][1] = tu[1][1];
dp[2][1] = dp[1][1] + tu[2][1];
for(int i = 1; i <= 2; i++){
for(int j = 2; j <= n; j++){
if(i == 1){
... | 220 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n);... | 379 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[2][n];
vector<int> ue(n+1),sita(n+1);
ue[0]=0;
sita[0]=0;
for(int i=0;i<2;++i){
for(int j=0;j<n;++j){
cin >> a[i][j];
if(i==0){
ue[j+1]=ue[j]+a[i][j];
}else{
sita[j+1]=sita[j]+a[i][j];
... | 239 |
Project_CodeNet | 2,018 | /*
ЗАПУСКАЕМ ВЫСОКОГО
░ГУСЯ░▄▀▀▀▄░РАБОТЯГИ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░... | 2,766 |
Project_CodeNet | 2,018 | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | 284 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fst() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define FOR(i,a,b) for(i=a;i<b;i++)
#define pb push_back
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef long double ld;
int main()
{
fst();
int i,n,a[2][100],s=0,m=0,j;
cin>>n;
for... | 205 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
//string s; cin >> s;
int u = 0, d = 0;
vector<vector<int> > a(2, vector<int> (n));
for(int i = 0; i < 2; i++){
for(int j = 0; j < n; j++){
cin >> a[i][j];
if(i == 1) d += a[i... | 192 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),a.end()
#define pw(x) (1LL<<(x))
#define db(x) cerr << #x << " = " << x << endl
#define db2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define db3(x... | 506 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make... | 1,873 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template<class T> void vin(vector<T>& v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int dp[2][101];
int... | 281 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iomanip>
#include<vector>
#include<queue>
#include<deque>
#include<string>
#include<utility>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<set>
#include<map>
#include<bitset>
#include<stack>
#include<ctime>
using namespace... | 331 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define N 110
#define LL long long
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define MP make_pair
int n,c,d;
int a[2][N];
int s1[N],s2[N];
int main(){
//jfreopen("in.txt","r",stdin);
cin>>n;
for(int i=1;i<=n;++i){
scanf("%d",&a[0][i]);
s1[i]+=s1[i-1]+a[0][i];... | 218 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int frow[n],srow[n],sum[n];
for(int i=0;i<n;i++){
scanf("%d",&frow[i]);
sum[i]=0;}
for(int i=0;i<n;i++)
scanf("%d",&srow[i]);
for(int i=0;i<n;i++)
{
for(int j=0;j<... | 167 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define ... | 453 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namesp... | 1,106 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;
int N,res,ans;
std::vector<int>A[2];
int main()
{
in >> N;
A[0].resize(N);
A[1] = A[0];
rep(i, N) { in >> A[0][i]; }
rep(i, N) { in >> A[1][i]; }
rep(i, N)
{
res = 0;
for (int... | 216 |
Project_CodeNet | 2,018 | #pragma comment(linker, "/STACK:102400000,102400000")
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define lson ro... | 727 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <deque>
#include <cstring>
#include <set>
#include <bitset>
#include <map>
#include <chrono>
#include <random>
#include <unordered_map>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef long do... | 443 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
//#include <boost/range/algorithm/find_if.hpp>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
const int INF = 999999999;
int main(){
int N;
cin >> N;
vector<int> A(N);
vector<int> ... | 342 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define PI acos(-1.0)
#define eps 1e-12
#define fi first
#define se second
#define MEM(a,b) memset((a),(b),sizeof(a))
#define mod(x) ((x)%MOD)
#define pii pair<int,int>
#define wz cout<<"-----"<<endl;
const int maxn = 1e... | 447 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
int P[N],A[N],n,i,ans,p;
signed main(){
cin >> n;
for(i=1;i<=n;i++) { cin >> P[i]; P[i] += P[i-1]; }
for(i=1;i<=n;i++) { cin >> A[i]; }
for(i=n; i ;i--){
p += A[i];
... | 147 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pb push_back
#define S second
#define F first
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pii;
const int maxn = 200 + 4;
const int mod = 1e9 + 7;
const int maxk = 2;
int dp[3][maxn],table[3][maxn];
int32_t main(){
int n;
cin >> n;
for (in... | 218 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n)... | 408 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.