Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include<stdio.h>
#include<algorithm>
using namespace std;
long long dp[2005][2005]={0};
struct Num{
long long val,id;
}num[2005];
bool cmp(Num a,Num b){
return a.val>b.val;
}
int main(){
long long i,j,n;
scanf("%lld",&n);
for(i=0;i<n;i++){
scanf("%lld",&num[i].val);
num[i].id=i;
... | 272 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi 2*acos(0.0)
#define f first
#define s second
#define pb push_back
#define gap ' '
#define fastio {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define mod 1000000007
#define N 2005
int n;
ll dp[N][N];
pair<ll,ll> p[N];
ll solve(int i,int l... | 269 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
#define ll long long
#define db double
#define clr(a, b) memset(a, b, sizeof(a))
const int maxn = 2e3 + 10;
const int inf = 0x7ffffff;
ll dp[maxn][max... | 441 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
v... | 910 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<pair<int,int>> A;
ll memo[2000][2000];
bool visited[2000][2000];
ll f(int p, int q) {
if (p == N) return 0;
if (visited[p][q]) return memo[p][q];
visited[p][q] = true;
ll Ax = A[p].first;
int x = A[p].second;
ll r1 = f(p+1, q+1) + A... | 230 |
Project_CodeNet | 2,020 | // template version 1.15
using namespace std;
#include <bits/stdc++.h>
// varibable settings
#define int long long
const int INF=1e18;
// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(_... | 1,101 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long int dp[2001][2001];
int n;
long long int t;
vector <pair<long long int,long long int>> v;
long long int solve(long long int a,long long int b)
{
if(dp[a][b]!=-1)
{
return dp[a][b];
}
int idx = a + (n-1 - b);
//cout << idx << ' ' << a << ' ' << b << '\n'... | 306 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs ve... | 609 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
struct map{
int index;
int64_t elem;
};
vector<map> A;
cin >> N;
for(int i=0;i<N;i++){
int64_t elem;
cin >> elem;
A.push_back({i,elem});
};
sort(A.begin(), A.end(), [](const m... | 611 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
using namespace std;
const int N=2005;
const int inf=1e9;
int n,dp[N][N];
pii a[N];
main()
{
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin>>n;
for(int i=1;i<=n;i++)
... | 322 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <math.h>
#include <sstream>
#include <numeric>
#include <string>
#include <cassert>
#include <bitset>
using namespace std;
typedef long long ll... | 458 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <queue>
#include <set>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <complex>
using ll = long long int;
using namespace std;
int main(){
// read problem
ll N, tmp;
vec... | 447 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define chmax(a, b) a = max(a, b)
#define fi first
#define se second
#define INF 1000000009
#define LLINF 1000000000000000009LL
using ll = long long;
using P = pai... | 336 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 563 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
... | 899 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template<class T> void chmax(T& a, T b){ a>b?:a=b; }
template<... | 407 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define rrep(i,a) for(int i=(int)a-1;i>=0;--i)
#define REP(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RREP(i,a,b) for(int i=(int)a-1;i>=b;--i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin... | 601 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (... | 485 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N = 3005;
int n, l, r;
pair<long long, long long> a[N];
long long f[N][N];
long long F(int i, int j)
{
if (i > j)
{
return 0;
}
if (f[i][j] != -1)
{
return f[i][j];
}
int now = j - i + 1;
long long ans = 0;
ans... | 330 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ff first
#define ss second
#define endl "\n"
#define MOD 100... | 688 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<boost/variant.hpp>
using namespace std;
typedef long long ll;
typedef vector<boost::variant<bool, ll, int, string, double, char*, const char*>> anys;
template<typename T> inline void pr(const vector<T> &xs){
for(int i=0; i<xs.size()-1; i++) cout<<xs[i]<<" ";
(xs.empty()?cout:(cout<<xs... | 401 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 2005;
int n, a[maxn];
int p[maxn];
vector<pair<int,int>> v(n);
ll dp[maxn][maxn];
ll f(int l, int r) {
ll& res = dp[l][r];
if (res != -1) return res;
if (l > r) return res = 0;
int i = l + (n-1-r);
ll val = v[i].f... | 251 |
Project_CodeNet | 2,020 | // Copyright [2020] <unknown>
#include <bits/stdc++.h>
using namespace std;
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define dbg(x...) { cerr << "\033[32;1m" << #x << " -> "; err(x); }
void err() { cerr << "\033[39;0m" << endl; }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); ... | 512 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e3 + 5, mod = 1e9 + 7;
ll n, dp[N][N];
pair<ll, ll> p[N];
ll solve(int idx, int mn, int mx){
if(idx == n) return 0;
if(dp[idx][mn] != -1) return dp[idx][mn];
ll op1 = solve(idx + 1, mn + 1, mx) + abs(mn - p[idx].second) * p[... | 306 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <random>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define o cout<<"BUG"<<endl;
#define IOS ios_base::sync_wi... | 495 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
//printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
... | 469 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ALL(v) std::begin(v),std::end(v)
using lint=long long;
using ld=long double;
template<class T>using numr=std::numeric_limits<T>;
template<std::size_t Idx, class Container, class Value = std::tuple_element_t<Idx, typename Container::value_type>>
auto project(Container const& container)
{
... | 436 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<int64_t,int64_t>>A(N);
for(int64_t i=0;i<N;i++){
int64_t a; cin>>a;
pair<int64_t,int64_t>p(a,i);
A.at(i)=p;
}sort(A.begin(),A.end());
int64_t dp[N][N];
for(int64_t j=0;j<N;j++)
dp[0][j]=A[0].first*abs(j-A[0]... | 224 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 742 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
//typedef vector<unsigned int>vec;
//typedef vector<ll>vec;
//typedef vector<vec> mat;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0... | 547 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) ... | 487 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) x.size()
#define all(a) a.begin(), a.end()
const int MAXN = 2050;
int n;
pair<int, int> a[MAXN];
long long dp[MAXN][MAXN];
long long calc(int pos, int l) {
long long& res = dp[pos][l];
if (res != -1)
return res;
res = 0;
if... | 288 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < n; i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long l... | 372 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
using Int = long long;
const char newl = '\n';
const Int MAX = 2020;
const Int INF = 1e18;
Int dp[MAX][MAX];
vector<... | 454 |
Project_CodeNet | 2,020 | //#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define all(x) x.begin(),x.end()
#define F first
#define S second
#define fo(i,n) for(int i=0;... | 469 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e3+2;
struct node{
ll a;
int b;
}A[MAXN];
bool cmp(node A,node B)
{
return A.a>B.a;
}
int N;
ll dp[MAXN][MAXN], ans;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i].a; A[i].b = i;
}
sort(A, A+N, cmp);
for (i... | 258 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#define ALL(p) (p).rbegin(),(p).rend()
using namespace std;
typedef long long ll;
int main(){
ll i,j,n,x,y,result;
ll a;
map<ll,ll> dp[2010];
//dp[i][j]: i人を配置し、うち左にj人、右にi-j人いるときのmax
cin >> n;
vector<pair<ll,ll> > p(n... | 311 |
Project_CodeNet | 2,020 | /*!enjoy karo yaar!*/
//CF,CC,AtC,SPOJ: hp1999
//HE: hemant269
//HR: hemant2132
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) (x).begin(),(x).end()
#define rz(x) ... | 688 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<string>vst;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
void fastio(){
ios_... | 570 |
Project_CodeNet | 2,020 | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#include <random>
#define REP(i,m,n) for(int i=in... | 851 |
Project_CodeNet | 2,020 | /*
ID: swagchicken1
PROG:
LANG: C++11
*/
#include <iostream>
#include <tuple>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <vec... | 633 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = (int)j;i <= (int)k;i ++)
#define debug(x) cerr<<#x<<":"<<x<<endl
const int maxn=(int)2e3+5;
pair<int,int> a[maxn];
typedef long long ll;
ll dp[maxn][maxn];
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;cin>>n;... | 525 |
Project_CodeNet | 2,020 | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> V... | 1,615 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3+5;
ll dp[maxn][maxn];
struct node{
ll pi,val;
}p[maxn];
bool cmp(node a,node b){
return a.val<b.val;
}
int main() {
int n;
scanf("%d",&n);
for(int i = 1;i<=n;i++) {scanf("%lld",&p[i].val); p[i].pi = i;}
sort(p+1,p+1+n,cmp);
... | 247 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mp make_pair
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int> > small_heap;
typedef priority_queue<int> big_heap;
const int N = 2e3 + 100;
pii p[N];
int n;
bool cmp(pii a, pii b) {... | 321 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
}
sort(a.rbegin(), a.rend());
vector<vector<long long>>... | 319 |
Project_CodeNet | 2,020 | #include<cstdio>
#include <functional>
#include <utility>
#include<algorithm>
using namespace std;
using ll = long long;
const static int MAX_N = 2000;
ll dp[2][MAX_N+5];
int main(){
int N;
scanf("%d", &N);
pair<ll, int> A[N];
for (int i = 0; i < N; ++i){
ll tmp;
scanf("%lld", &tmp);
A[i] = make_pair(tmp, i)... | 376 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);++i)
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T, class U> void amax(T& x, U y) {if (x < y) x = y;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | 337 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define endl "\n"
#define loop(i,s,e) for(int i=s;i<e;i++)
#define int ... | 544 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define gcd(m,n) __gcd(m,n)
#define lcm(m,n) m*(n/gcd(m,n))
#define fast std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define endl '\n'
#define MOD 1000000007
#define ull unsigned long long
#define ll long long
#define ld long double
#define pb push_back
... | 416 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B>... | 478 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
... | 1,305 |
Project_CodeNet | 2,020 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i,n) for(int i=0;i<(n);i++)
//here!!!
// define int long long !!!!!
#defin... | 5,114 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e3 + 5;
int ord[N], a[N];
ll dp[N][N];
int n;
ll solve(int l, int r) {
if (l > r) return 0;
ll &ret = dp[l][r];
if (ret != -1) return ret;
int indx = ord[(l - 1) + (n - r) + 1];
ret = max(solve(l + 1, r) + a[indx] * ... | 281 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(c) c.begin(), c.end()
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
#define gadd(x,y) x=add(x,y)
#define gmul(x,y) x=mul(x,y)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef array<int,2> pii;
con... | 392 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <memory>
#include <string>
#include <cstdlib>
#include <set>
#include <utility>
#include <vector>
#include <list>
#include <algorithm>
#include <regex>
#include <cmath>
#include <map>
#include <iterator>
#include <climits>
#include <numeric>
#inc... | 861 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <iterator>
//#include <cmath>
#include <set>
#include <deque>
#include <string>
using namespace std;
int n;
long long f[2010][2010]; //i--left，j--right左区，右区
struct Elem
{
int oriPos;
long long val... | 593 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2020;
long long dp[N][N];
pair<int,int> a[N];
signed main(){
int n;
scanf("%lld", &n);
for(int i = 1;i<=n;i++){
int x;
scanf("%lld", &x);
a[i] = pair<int,int>(-x,i);
}
sort(a+1,a+n+1);
fo... | 312 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b, _c = c; a <= _c; ++a)
#define int long long
const int N = 3e3 + 5;
int n, l, r;
pair<int, int> a[N];
int f[N][N];
int F(int i, int j) {
if(i > j) return 0;
if(f[i][j] != -1) return f[i][j];
int now = j - i + 1;
int ans = 0;
a... | 321 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
... | 436 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long... | 631 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define All(v) (v).begin(),(v).end()
int dy[8] = {-1,0,1,0,-1,1,1,-1};
int dx[8] = {0,1,0,-1,1,1,-1,-1};
const int mod = 1000000007;
const int inf = mod*mod;
const int d5 = 100100;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int... | 424 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e3+5;
ll dp[N][N],n,k;
vector<pair<ll,ll> >v;
ll solve(ll l,ll r){
if(r<l) return 0;
if(dp[l][r]!=-1) return dp[l][r];
ll i=l+n-r-1;
return dp[l][r]=max(v[i].first*abs(v[i].second-l)+solve(l+1,r),v[i].first*abs(v[i].second-r... | 195 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define debug(x) cout << '>' << #x << ':' << x << endl
using namespace std;
using ll = long long;
const int N = 2005;
ll dp[N][N];
ll memo(vector<pair<ll, ll>> &a, ll idx, ll first, ll last) {
// A[x] * abs(x - y)
if (idx == 0) return 0;
ll actualIdx = a[idx].second;
ll &ans... | 365 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef pair<long long,int> Pair;
const int maxn=2007;
int N;
const int M=-1000000000000000;
vector<Pair> A;
long long f[maxn][maxn];
long long dp(int x,int y)
{
if(x==0&&y==0) return 0;
if(f[x][y]!=M) return f[x][y];
if(y==0)
f[x][y]=A[x+y-1].first... | 453 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim... | 798 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e3 + 10;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
int n,a[N],f[N];
LL dp[N][N];
bool vis[N][N];
int main() {
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i],f[i]=i;
sort(f+1,... | 384 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
#define fi first
#define se second
#define all(c) c.begin(),c.end()
typedef long long int ll;
typedef pair<ll, ll> P;
typedef long double ld;
void Ans(bool x){if(x) cout<<"Yes"<<endl;else co... | 423 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000*100+1
#define numberOfSetBits(S) __builtin_popcount(S) // __builtin_popcountl(S) __builtin_popcountll(S)
#define MSET(x,y) memset(x,y,sizeof(x))
#defin... | 587 |
Project_CodeNet | 2,020 | #include <iostream>
#include<map>
#include<algorithm>
#include<cstring>
#include<cmath>
#define LL long long
using namespace std;
const int MAXN = 2010;
const int MAXA = 1e9;
pair<int, int> A[MAXN];
LL dp[MAXN][MAXN];
int N;
LL ans;
int main() {
cin >> N;
memset(dp, 0, sizeof(dp));
for(int i=1; i<=N; i++) {
cin... | 395 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, int> pli;
int main(){
ios::sync_with_stdio(0);
cout << setprecision(10) << fixed;
long long n;
cin >> n;
vector<pli> a(n + 1);
for (int i = 1; i <= n; ++i){
cin >> a[i].first;
a[i].second = i;
}
sort(a.begin() + 1, a.end());
reverse(a.b... | 336 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v)... | 426 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
#define maxn 2005
using namespace std;
int arr[maxn],idxs[maxn];
ll dp[maxn][maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for(int i=1;i<=n;i++)
cin >> arr[i] , idxs[i] = i;
sort(idxs+1,idxs+1+n,[=](int a,int b)->bool
{return arr[a] > ar... | 289 |
Project_CodeNet | 2,020 | /* Author: Rennan Rocha
* Time: $%Y%$-$%M%$-$%D%$ $%h%$:$%m%$:$%s%$
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ll long long
#define vi vector<int>
#define vll vector<ll>... | 392 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define PI pair<int,int>
const int maxm=2e3+5;
int d[maxm][maxm];
PI a[maxm];
int n;
bool cmp(PI a,PI b){
return a.first>b.first;
}
signed main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].first;
a[i].second=i;
}
sort(... | 413 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.e... | 1,451 |
Project_CodeNet | 2,020 | // g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
... | 627 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(x) x.begin(), x.end()
ll dp[5007][5007];
pair<int,int> a[5007];
int main()
{
int n;
cin >> n;
//vector<pair<int,int>> a(n+1);
for(int i=1;i<=n;i++){
cin >> a[i].first;
a[i].second = i;
}
ll ans = ... | 293 |
Project_CodeNet | 2,020 |
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <itera... | 1,741 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, x, n) for(ll 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 =... | 489 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define... | 4,707 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define all(x) (x).begin(),(x).end()
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define re... | 446 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> A(N);
for (int64_t& a : A) {
cin >> a;
}
struct Element {
int64_t from, cost;
bool operator<(const Element& rhs) const {
return cost < rhs.cost;
}
... | 428 |
Project_CodeNet | 2,020 | // #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define ll int
#define cps CLOCKS_PER_SEC
#define bits_count __builtin_... | 639 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vecto... | 530 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
#define pb push_back
template<class T> inline bool chmin(T &a, T b){
if(a>b){a=b;return t... | 348 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define int long long
#define INF 1000000000000000007ll
using namespace __gnu_pbds;
using namespace std;
int n,dp[2020][... | 394 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define ldou lo... | 687 |
Project_CodeNet | 2,020 | /* ****TCIITB**** */
#include<bits/stdc++.h>
#define io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll int long long
#define pb push_back
#define endl '\n'
#define pii pair<int long long,int long long>
#define vi vector<int long long>
#define ... | 398 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
constexpr ll M = 1e9 + 7;
inline ll sum_1(const ll n) { return ((n * (n + 1)) / 2) % M; }
inline ll sum_2(const ll n) { return ((n * (n + 1) * (2 * n + 1)) / 6) % M; }
inline ll sum_3(const ll n) { return (((n * (n + 1)) / 2) % M * ((n * (n + 1)) ... | 681 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template<class T> usin... | 4,142 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 634 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long lo... | 1,115 |
Project_CodeNet | 2,020 |
// Problem : E - Active Infants
// Contest : AtCoder - AtCoder Beginner Contest 163
// URL : https://atcoder.jp/contests/abc163/tasks/abc163_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hp... | 1,205 |
Project_CodeNet | 2,020 | /*input
6
8 6 9 1 2 1
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i,j,n) for(i=j;i<n;i++)
#define repi(i,j,n) for(i=j;i>n;i--)
#define inf 100001
#define M 1000000007
#define ll long long
#define ld long double
#define vll vector<long long>
#... | 546 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fr(i,n) for(int i=0; i<n; i++)
#define rep(i, st, en) for(int i=st; i<=en; i++)
#define repn(i, st, en) for(int i=st; i>=en; i--)
#define sq(a) (a*a)
typedef long long ll;
typedef pair<int, int> pii;
typedef pai... | 1,065 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define int long long
#define inf 10000000000000000
#define FLASH cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);
#define FILEIO freopen("/home/aman/Desktop/Kachda/input.txt", "r", stdin); //freopen("/home/aman/Desktop/Kachda/output.txt", "w", stdout);
using namespace std;
int n;
pa... | 384 |
Project_CodeNet | 2,020 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author zjsdut
*/
#ifndef ALGO_UTILS
#define ALGO_UTILS
#include <algorithm>
#include <vector>
template<typename A, typename B>
bool chkmin(A &a, const B &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
... | 1,715 |
Project_CodeNet | 2,020 | //header
#ifdef LOCAL
#include "cxx-prettyprint-master/prettyprint.hpp"
#define debug(x) cout << x << endl
#else
#define debug(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//types
using namespace std;
using ll = long long;
using ul = unsigned long long;
u... | 1,694 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)... | 577 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.