제출 #382190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
382190		MODDI	새로운 문제 (POI11_pio)	C++14	27 / 100	1099 ms	4612 KiB

pio

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
using namespace std;
int n;
vl arr;	
int main(){
	
	cin>>n;
	for(int i = 0; i < n; i++){
		int a;
		cin>>a;
		arr.pb(a);
	}
	for(int i = 0; i < n; i++){
		int rez = 0;
		for(int j = 0; j < n; j++){
			if(j == i)
				continue;
				
			int p = (arr[j] + ceil(sqrt(abs(i - j)))) - arr[i];
			//cout<<p<<" at "<<i<<" "<<j<<endl;
			rez = max(rez, p);
		}
		cout<<rez<<endl;
	}
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10