Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
using namespace std;
#define MOD 1000000007
#define INF (1<<29)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P... | 226 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
#define readInt(x) scanf("%d", &x)
#define readStr(x) scanf("%s", x)
#define rep(i, n) for(int i=0; i<(n); ++i)
#define write(x) cout << (x) << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1 << 28;
const int MAX = 1e5 + 10;
int N;
int A[2][110... | 240 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 2000003;
const int MOD = 1000000007;
//
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
... | 400 |
Project_CodeNet | 2,018 | /*Aonyx Cinerea*/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 + 17;
int A[MAXN], B[MAXN];
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
int n; cin >> n;
for(int i=1; i<=n; ++i)
{
cin >> A[i];
A[i] += A[i-1];
}
for(int i=1; i<=n; ++i)
c... | 182 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int a[3][105],dp[3][105],n;
int main()
{
cin>>n;
for(int i=1;i<=2;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
dp[1][1]=a[1][1];
for(int i=1;i<=2;i++)
{
for(int j=1;j<=n;j++)
{
... | 161 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <climits>
using namespace std;
vector<int> uppers;
vector<int> lowers;
vector<int> uppers_acc;
vector<int> lowers_acc;
int N;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> ... | 321 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define loop(i,L,R) for(int i=(L);i<=(R);i++)
#define rept(i,L,R) for(int i=(L);i<(R);i++)
#define isc(n) scanf("%d",&n)
#define llsc(n) scanf("%lld",&n)
#define dsc(n) scanf("%lf",&n)
#define enl cout<<endl
#define PB(x) push_back(x)
#define MP(x,y) make_pair(x,y)
#define x... | 261 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <math.h>
#include <utility>
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
using namespace std;
int maxi = 0;
int tans(int a[2][100], int n, int i, int j,int sum) {
sum += a[i][j];
if (i == 1 && j == n - 1) {
max... | 256 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int n, a, d[5][105];
int main() {
int i, j;
cin>>n;
for(i=1; i<=2; i++) for(j=1; j<=n; j++) {
cin>>a;
d[i][j] = max(d[i-1][j], d[i][j-1]) + a;
}
cout<<d[2][n];
return 0;
} | 100 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <cmath>
#include <stack>
#include <string>
#include <iomanip>
#include <queue>
#include <deque>
#include<cstring>
#include<limits>
#include <sstream>
#inc... | 389 |
Project_CodeNet | 2,018 | /*"-Aria on the Planetes-"*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double D;
typedef pair<int,int> Pii;
#define mp(a,b) make_pair(a,b)
#define fir first
#define sec second
inline int min(int _a,int _b){return _a<_b?_a:_b;}
inline int max(int _a,int _b){return _a>_b?_a:_b;}
template<... | 390 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define all(a) (a).begin(), (a).end()
constexpr int MAX_N = 100;
int N;
int A[2][MAX_N], S[2][MAX_N+1];
int dp[2][MAX_N];
int main()
{
scanf( "%d", &N );
rep( i, 2 ) rep( j, N )
scanf( "%d", &A[i]... | 208 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int s[2][105];
int a[2][105];
int main() {
int n;
cin >> n;
for (int i = 0; i < 2; i++) {
for (int ni = 0; ni < n; ni++) {
cin >> a[i][ni];
}
}
s[0][0] = a[0][0];
s[1][0] = s[0][0] + a[1][0];
for (int ni = 1; ni < n; ni++) {
s[0][ni] = s[0][ni -... | 209 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
#include <math.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define re... | 466 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << (x) << endl
class bipartite_matching {
public:
int n;
std::vector<std::vector<int>> g;
std::vector<i... | 452 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define N 120
int n,a[N],b[N],f[N],g[N];
int main(){
scanf("%d",&n);
for (int i=1;i<=n;++i){
scanf("%d",&a[i]);
f[i]=f[i-1]+a[i];
}
for (int i=1;i<=n;++i){
scanf("%d",&b[i]);
g[i]=max(g[i-1],f[i])+b[i];
}
printf("%d\n",g[n]);
return 0;
}
| 126 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#define Rep(i,a,b) for(register int i=(a),i##end=(b);i<=i##end;++i)
using namespace std;
template<typename T>inline void read(T &x)
{
T s=0,f=1;static char c;
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-1;
for(;isdigit... | 227 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <unistd.h>
#define ll long long
#define inf 1000000007
#define inf16 0x3f3f3f3f
#define INF 1000000000000000007LL
#define VI vector<int>
#define VPII vector<pair<int, int> >
#define VLL vector<ll>
#define PII pair<int, int>
#define st first
#define nd second
#define pb push_back
#defin... | 276 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define lld long double
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define vull vector<ull>
#define all(v) v.begin(),v.end()
#define mp make_pair
#define bitcount(x... | 854 |
Project_CodeNet | 2,018 | /*
Resilience is the greatest of all virtues.
Code by rajiv
*/
#include <iostream>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <cassert>
#include <sys/time.h>
#include <algorithm>... | 655 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll... | 365 |
Project_CodeNet | 2,018 | #include <iostream>
#define MAX 110
using namespace std;
int n,ans,s1[MAX],s2[MAX];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)cin>>s1[i],s1[i]+=s1[i-1];
for(int i=1;i<=n;i++)cin>>s2[i],s2[i]+=s2[i-1];
for(int i=1;i<=n;i++){
ans=max(ans,s1[i]+s2[n]-s2[i-1]);
}
cout<<ans;
return 0;
}
| 130 |
Project_CodeNet | 2,020 | /**
* author: qodjf
* created: 07.11.2020 10:50:20
*/
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename... | 660 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int n;
int f[12][12313],a[12][12313];
int main()
{
int i,j;
scanf("%d",&n);
for(i=1;i<=2;i++)
for(j=1;j<=n;j++) scanf("%d",&a[i][j]);
for(i=1;i<=2;i++)
for(j=1;j<=n;j++)
f[i][j]=max(f[i-1][j],f[i][j-1])+a[i][j];
printf("%d\n",f[2][n]);
} | 134 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
#include <bitset>
using ll = long long;
typedef unsigned long long ull;
typedef s... | 403 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define INF 1e9
#define Puts(x) puts(x? "Yes":"No")
const int mod = 1e9 + 7;
typedef long long i64;
typedef pair<int, int> pi;
template <class T> using vt = vec... | 389 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <functional>
#includ... | 403 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
#define INF 1<<30
#define LINF 1ll<<60ll
#define MOD 1000000007
#define pb(a) push_back(a)
#defi... | 507 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <list>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int a[2][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=... | 172 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <list>
#include <string.h>
#include <functional>
#include <unordered_set>
#include <unordered... | 451 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[2][101];
int ans;
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 >> a[i][j];
for(int i=0; i<n-1; ++i){
a[0][i+1] += a[0][i];
a[1][n-2-i] += a[1][n-1-i];
}
for(int i=0; i<n; ... | 171 |
Project_CodeNet | 2,018 | #include <iostream>
#include <utility>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[2][n];
for(int i = 0; i < 2; i++) {
for(int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
int ans = 0;
for(int i = 0; i < n; i++) {
int sum = 0;
for(int j = 0; j <= i; j++) {
sum ... | 175 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstring>
#include<cstdio>
#define N 100010
using namespace std;
int a[N],b[N];
int main()
{
int n;scanf("%d",&n);int ans=0;
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++) a[i]+=a[i-1];
for(int i=n;i>=1;i--) b[i]+=b[i+1];
for(int ... | 146 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define scanInt(x) int x; scanf("%d", &(x)); getchar();
#define scanLLInt(x) ll x; scanf("%lld", &(x)); getchar();
#define scanVecInt(A, N) vector<int> A(N); REP(i, N){scanf("%d", &(A[i])); getchar... | 278 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
using namespace std;
int main() {
int n; cin >> n;
vector<int>a1(n), a2(n);
for (auto&& x : a1)cin >> x;
for (auto&& x : a2)cin >> x;
for (int i = 0; i < n - 1; i++)a1[i + 1] += a1[i];
for (int i = 0; i < n - 1; i++)a2[i + 1] += a2[i];
int ans = a1[0] + a2[n - 1];
for (int i... | 194 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
constexpr int MaxN = 100;
int main()
{
int N;
int A[2][MaxN];
cin >> N;
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < N; ++j)
{
cin >> A[i][j];
}
}
int max = 0;
max += A[0][0];
for (int i = 0; i < N; ++i)
{
max += A[1][i];
}
int X = max;
for (int... | 200 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fo(i, n) for(int i = 1; i <= n; ++i)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 200200;
const int mod = 1e9 + 7;
int n, d[3][N], a[3][N];
in... | 180 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);... | 319 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<algorithm>
using namespace std;
int a[2][101];
int sum[101];
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < 2; i++) {
for (int y = 1; y <= n; y++)
scanf("%d", &a[i][y]);
}
int dap = 0;
for (int i = 1; i <= n; i++)
{
sum[i] = sum[i - 1]+a[1][i];
}
int x = 0;
for (int... | 183 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define sd(x) scanf("%d",&(x))
#define pd(x) printf("%d",(x))
#define slld(x) scanf("%lld",&(x))
#define plld(x) printf("%lld",(x))
#define br printf("\n")
#define pi pair<int,int>
#define pii pair<long long int, long long int>
#define vi vector<int... | 396 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
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[i][j];
for (int i = 1; i < n; ++i) {
a[0][i] += a[0]... | 203 |
Project_CodeNet | 2,018 | /*
# # ##### ## ## ##### ## # # # # #####
# # # # # ### # # # ## # # # # # #
# # # # # # # # # ## # # # # # #
# # # # # # ##### # # # # ### #####
# # # # # #... | 783 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define N 1000
#define oo 0x3fffffff
#define fr(i,n) for(i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>pii;
int a[2][N],t[N][N];
int n;
int main(void){
int i,j,x,y;
//freopen("in.txt","r",stdin);
scanf("%d",&n);
for(i=1;i<=2;i++)for(j=1;j<=n;j+... | 160 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cctype>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
int dp[5][110],n,a[5][110];
int main(){
scanf("%d",&n);
for(int i=1;i<3;i++)
for(int j=1;j<=n;j++)scanf("%d",a[i]+j),dp[i][j]=max(dp[i-1][j],dp[i][j-1])+a[i][j];
printf("%d",dp[2][n]);
return 0;
} | 116 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;++i)
#define per(i,a,n) for(int i=n-1;i>=a;--i)
#define pb push_back
#define mp make_pair
#define VI vector<int>
#define INF 1e9
#define ll long long
const int N=205;
const int M=200005;
int a[3][N];
int dp[3][N];
int main(){
ios::sy... | 278 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) '[' << #x << " is: " << x << "] "
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 2e5 + 100;
vector<int> g[nax];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
... | 302 |
Project_CodeNet | 2,018 | // 28.01.2018
/*
*/
# include <iostream>
# include <iomanip>
# include <cstdio>
# include <cstdlib>
# include <cmath>
# include <cstring>
# include <vector>
# include <stack>
# include <queue>
# include <algorithm>
//# define __TRR__
# define lint long long int
using namespace std;
const int N = 111;
int ... | 438 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define R freopen("555input.txt","r",stdin);
#define N 105
int i,j,t,n,sa[N],sb[N],ma;
int main ()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>t;
sa[i]=sa[i-1]+t;
}
for(i=1;i<=n;i++)
{
cin>>t;
sb[i]=sb[i-1]+t;
}
fo... | 154 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector <int> a1, a2;
for(int i=0;i<N;i++){
int aa;
cin>>aa;
a1.push_back(aa);
}
for(int i=0;i<N;i++){
int aa;
cin>>aa;... | 171 |
Project_CodeNet | 2,018 | // eddy1021
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef double D;
typedef long double LD;
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
#define mod9 1000000009LL
#define mod7 1000000007LL
#define INF 1023456789LL
#define INF16 10000000000000000LL
#define... | 869 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int n, c[10][1000], f[10][1000];
int main() {
cin >> n;
for(int i = 1; i <= 2; ++i) {
for(int j = 1; j <= n; ++j) {
cin >> c[i][j];
}
}
for(int i = 1; i <= 2; ++i) {
for(int j = 1; j <= n; ++j) {
... | 172 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
#include<bitset>
#include<map>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i = (ll)(a) ; i < (ll)(b) ; i++)
#define repd(i,a,b) for(ll i = (ll)(a) ; i > (ll)(b) ; i--)
ll n, ans;
ll a[2][110], s[2][110];
... | 255 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int a[2][103]={0};
int main(){
int n;
cin >> n;
for(int i=0;i<2;++i)
for(int j=0;j<n;++j)
cin >> a[i][j];
int ans = 0;
for(int i=0;i<n;++i){
int sum = 0;
for(int j=0;j<n;++j){
if(j <= i)sum += a[0][j];
... | 151 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
using namespace std;
typedef vector<int> vint;
typedef pair<int,int> pint;
signed main()
{
int N; cin>>N;
vint a(N),b(N);
REP(i,N) cin>>a[i];
REP(i,N) cin>>b[i];
for(int i... | 170 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std; typedef long long ll; const int INF=1e9;
typedef pair<int,int> P;
int main() {
int n; cin>>n;
int a[2][n];
for(int i=0;i<n;i++) cin>>a[0][i];
for(int i=0;i<n;i++) cin>>a[1][i];
int an=0;
for(int i=0;i<n;i++) {... | 195 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 634 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define bug(x) cout<<(#x)<<" "<<(x)<<endl
#define ll long long
/*
char *TT,*mo,but[(1<<15)+2];
#define getchar() ((TT==mo&&(mo=(TT=but)+fread(but,1,1<<15,stdin),TT==mo))?-1:*TT++)//*/
using namespace std;
const int N=1e5+5;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'... | 275 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
int matrix[2][n];
for (int i=0; i < 2; i++){
for (int j=0; j < n; j++){
cin >> matrix[i][j];
}
}
int ans = 0;
for (int i=1; i... | 183 |
Project_CodeNet | 2,020 | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 346 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N = 105;
int A[2][N];
int P[2][N];
int main(){
int n;
cin >> n;
for(int j = 0; j < 2; j++)
for(int i = 1; i <= n; i++) cin >> A[j][i], P[j][i] = P[j][i - 1] + A[j][i];
int ans = 0;
for(int i = 1; i <= n; i++){
ans = max(ans, P[0][i] + P[1][n] - P[1][i - 1... | 151 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a1, a2;
int main()
{
cin >> n;
a1.resize(n);
a2.resize(n);
for (int i = 0; i < n; i++) cin >> a1[i];
for (int i = 0; i < n; i++) cin >> a2[i];
vector<int> dp1(n, 0);
vector<int> dp2(n, 0);
dp1[0] = a1[0];
dp2[0] = a1[... | 217 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <string>
#include <cmath>
#include <string>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <iomanip>
#include <tuple>
#include <queue>
#include <numeric>
using namespace std;
typedef long long ll;
#define rep(i, a, n) for (int i=a;i<n;++i)
#define repeq(i, ... | 401 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... | 235 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int N = 100010;
const int INF = 1LL<<55;
const int mod = (1e9)+7;
const double EPS = 1e-8;
const double PI = 6.0 * asin(0.5);
typedef pair<int,int> P;
typedef long long ll;
ostream& operator<<(ostream& o,P p){return o<<... | 382 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int n;
int a[2][105],dp[2][105];
ll solve(){
dp[1][1]=a[1][1];
dp[2][1]=dp[1][1]+a[2][1];
for(int i... | 270 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
int n;
cin >> n;
int a[2][n];
for(int i = 0;i < n;i++){
cin >> a[0][i];
if(i)
a[0][i] +=... | 230 |
Project_CodeNet | 2,018 | /* *** In The Name of God ... *** */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
#define all(v) v.begin() , v.end()
#define pb push_back
#define endl '\n'
template<typename T> inline bool smin(T &a, const T &b){ return b < a ? a = b,1:0;}
tem... | 320 |
Project_CodeNet | 2,019 | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repA(i, a, n) for(int i = a; i <= (n); ++i)
#define repD(i, a, ... | 402 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e5+5;
const int INF=0x3f3f3f;
int a[3][105];
int dp[3][105];
int main(void){
int n;
cin >> n;
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
dp[1][1]=a[1][1];
dp[2][1]=dp[1][1]... | 250 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <climits>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <functional>
#include <numeric>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <unordered_map>
#incl... | 468 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a), i##_END_ = (b); i <= i##_END_; i++)
#define DNF(i, a, b) for (int i = (a), i##_END_ = (b); i >= i##_END_; i--)
template <typename Tp> void in(Tp &x) {
char ch = getchar(), f = 1; x = 0;
while (ch != '-' && (ch < '0' || ch > '9'))... | 479 |
Project_CodeNet | 2,018 |
#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
const int INF=100000000LL;
typedef pair<int,int>P;
vector<P> v;
int n;
int main() {
cin>>n;
int a[3][101];
int c[3][101]={};
for(int i=1;i<=2;++i){
for(int j=1;j<=n;++j)cin>... | 178 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int N=110;
int n,f[3][N];
int main(){
scanf("%d",&n);
for (int i=1;i<=2;++i)
for (int j=1;j<=n;++j){
scanf("%d",&f[i][j]);
f[i][j]+=max(f[i-1][j],f[i][j-1]);
}
printf("%d",f[2][n]);
return 0;
}
| 107 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <string>
#include <cstring>
#include <sstream>
#include <queue>
#include <iomanip>
#include <algorithm>
using namespace std;
const int Maxn = 105;
int A[Maxn], B[Maxn];
int n;
int res;
int main()
{
scanf(... | 215 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[])
{
int n;
cin>>n;
int a[3][111];
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
a[1][0]+=a[0][0];
for(int i=1;i<n;i++){
a[0][i]+=a[0][i-1];
}
for(int i=1;i<n;i++){
a[1][i]+=max(a[0][i],a[1][i-1]);
}... | 158 |
Project_CodeNet | 2,018 | /*+lmake
* STD = c++14
* DEFINE += MDEBUG
*/
// failed to generate code
#include <bits/stdc++.h>
using namespace std;
using LL=long long;
#ifdef DEBUG
#define debug(args...) {dbg,args; cerr<<endl;}
#else
#define debug(args...) // Just strip off all debug tokens
#endif
struct debug... | 293 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using mat = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll ... | 721 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<vector<int>> dp(2,vector<int>(N,0));
for(int i=0;i<N;i++){
int x;
cin>>x;
if(i==0){
dp.at(0).at(i)=x;
}else{
dp.at(0).at(i)=dp.at(0).at(i-1)+x;
}
}
for(int i=0;i<N;i++){
int x;
cin>>x;
... | 202 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int MAX_N = 100;
int n, ans, sum, a[2][MAX_N];
int main() {
cin >> 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]);
for (int i = 0; i < n; i++) {
sum = 0;
f... | 189 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
const int maxn = 12345;
int n , a[2][maxn];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(NULL);
cin >> n;
for(int j=0;j<2;j++)
for(int i=0;i<n;i++)
cin >> a[j][i];
for(int j=0;j<2;j++)
for(int i=1;i<n;i++)
a[... | 194 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define TASKNAME ""
using namespace std;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 7;
const double EPS = 1e-8;
int main() {
#ifdef MY
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#else
//freopen(TASKNAME".... | 365 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(2, vector<int>(n, 0));
for (int i = 0; i < 2 * n; i++) {
if (i < n) {
cin >> a[0][i];
} else {
cin >> a[1][i - n];
... | 216 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<vector<ll>> candies(2, vector<ll>(N));
for (int i = 0; i <= 1; i++)
{
for (int j ... | 282 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | 2,024 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
typedef long long LL;
const int N=20005;
LL a[2][N],f[2][N];
int main(void) {
int n; scanf("%d",&n);
rep(i,1,2) rep(j,1,n) scanf("%lld",&a[i][j]);
rep(i,1,2) rep(j,1,n) f[i][j]=std:: max(f[i-1][j],f[i][j-1])+... | 150 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ul;
typedef signed long long ll;
ul over = 1000000007;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
int n;
cin >> n;
int a[n][2];
for (int i=0; i<n; ++i) cin >> a[i][0];
for (int i=0; i<n; ++i) cin >> a... | 238 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define allof(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 105;
int N;
int arr[2][MAXN];
int main(){
cin.tie(0);
cin.sync_with_stdio(0);
cin >> N;
for(int a = 1; a <= N; a++){
... | 239 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for(int i = x; i < (int)(n); ++i)
int x[2][100];
int main(){
int n;
scanf("%d", &n);
f(o, 0, 2)f(i, 0, n)scanf("%d", x[o] + i);
f(i, 1, n)x[0][i] += x[0][i - 1];
for (int i = n - 2; i >= 0; --i)x[1][i] += x[1][i + 1];
int an =... | 182 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <memory.h>
#include <cstring>
#include <vector>
#include <deque>
#include <cstdlib>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <functional>
#include <iostream>
#include <set>
#include <list>
#include <map>
#include <time.h>
#include <unordered_map>
#inc... | 430 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<math.h>
#include<string.h>
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
#define N 102
int a[3][N],road[3][N],n;
// int dp[N][N];
int maxSum()
{
int i,sum = 0;
for(i = 1; i <= n; i++)
road[1][i] = road[1][i-1]+a[1][i];
for(i = n; i >= 1; i--)
road[2][i] = road[2][i+1]+a[2][i];
... | 285 |
Project_CodeNet | 2,019 | #define rep(i, a, b) for(int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template<class T> inline void chmax(T &a, const T &b) {if(a < b) a = b;}
template<class T> inline void chmin(T &a, const T &b) {if(a > b) a = b;}
const long long INF = 1LL<<60;
int main(void) {... | 279 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
const int maxn=1e5+5;
typedef long long ll;
int pre[maxn],suf[maxn],a[maxn][3];
int n;
int main(){
cin>>n;
for (int j=1;j<=2;j++){
for (int i=1;i<=n;i++){
scanf("... | 201 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int n,m,t;
int a[2][105];
int i,j,k;
int s=0,s2=0;
cin>>n;
for(i=0;i<2;i++){
for(j=0;j<n;j++){
cin>>a[i][j];
if(i==1)s2+=a[i][j];
}
}
for(i=0;i<n;i++){
s2+=a[0][i];
if(s<s2)s=s2;
s2-=a[1][i];
}
cout<<s<<endl;
return 0;
}
| 134 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <functional>
using namespace std;
typedef long long ll;
int sum[2][103];
int main() {
int n; cin >> n;
int a[2][103];
for (int i = 0; i < 2; ++i) ... | 290 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using... | 296 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 10, inf = 1e9;
int a[3][maxn], dp[3][maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
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 <= n;... | 246 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
using namespace std;
#define ll long long
#define vel vector<ll>
#define vvel vector<vel>
#define vvvel vector<vvel>
#define veb vector<bool>
#define pin pair<int,int>
#define mkp make_pair
#define... | 566 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#define LL long long
int N;
int A[3][101];
int main() {
std::cin >> N;
for (int i = 1; i <= 2; i++) {
for (int j = 1; j <= N; j++) {
std::cin >> A[i][j];
}
}
for (int i = 1; i <= 2; i++) {
for (int j = 1; j <= N; j++) {
A[i][j] += std::max(A[i - 1][j], A[i][j - 1])... | 161 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define mp make_pair
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
int dp[3][105], a[3][105];
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;... | 238 |
Project_CodeNet | 2,019 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>... | 360 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.