http://codeforces.com/contest/359
//-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
题意:给出数组a[1~n],数组元素非降。x是素数,把通分后(分母是xa1 + a2 + ... + an),求分子分母的gcd
题解:
#include<cstdio>
#include<map>
using namespace std;
typedef long long ll;
const int N=100005;
const int mod=1000000007;
ll a[N];
map<ll,int> mp;
ll quick(ll n,ll k) {
ll ans=1;
while(k) {
if(k&1) ans=ans*n%mod;
k>>=1;
n=n*n%mod;
}
return ans;
}
int main() {
int n,x;
while(~scanf("%d%d",&n,&x)) {
ll sum=0;
for(int i=1;i<=n;++i) {
scanf("%I64d",&a[i]);
sum=sum+a[i];
}
ll ans=sum-a[n],cnt=0;
int p=n;
for(;;) {
while(p>=1&&sum-a[p]==ans) {
++cnt;
--p;
}
if(cnt%x) break;
++ans;
cnt=cnt/x;
}
printf("%I64d\n",quick(x,min(ans,sum)));
}
return 0;
}
//-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
题解:用栈做两次,处理出每个数能向左向右延伸到多远。然后O(n)维护最大的r-l就行了
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=300005;
int a[N],l[N],r[N],sta[N],b[1000005],c[N];
int main() {
int n;
while(~scanf("%d",&n)) {
memset(l,-1,sizeof(l));
memset(r,-1,sizeof(r));
int p=0;
for(int i=1;i<=n;++i) {
scanf("%d",&a[i]);
while(p&&a[i]%a[sta[p]]) {
r[sta[p]]=i-1;
--p;
}
sta[++p]=i;
}
p=0;
for(int i=n;i>=1;--i) {
while(p&&a[i]%a[sta[p]]) {
l[sta[p]]=i+1;
--p;
}
sta[++p]=i;
}
for(int i=1;i<=n;++i) {
if(l[i]==-1) l[i]=1;
if(r[i]==-1) r[i]=n;
}
int ans=0;
for(int i=1;i<=n;++i) ans=max(ans,r[i]-l[i]);
memset(b,0,sizeof(b));
for(int i=1;i<=n;++i) {
if(ans==r[i]-l[i]) {
b[l[i]]=1;
}
}
int m=0;
for(int i=1;i<=n;++i) {
if(b[i]) c[++m]=i;
}
printf("%d %d\n",m,ans);
for(int i=1;i<=m;++i) printf("%d ",c[i]);puts("");
}
return 0;
}
//-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
1:打开灯
2:熄灭灯
L R U D:向四个方向移动。只有该方向上有灯亮着才能移动。
题解:暴搜。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define de(x) cout << #x << "=" << x << endl
const int N=505;
int a[N][N],vis[N][N];
char ans[3000005];
int n,m;
bool shang(int x,int y) {
for(--x;x>=1;--x) {
if(a[x][y]) return 1;
}
return 0;
}
bool xia(int x,int y) {
for(++x;x<=n;++x) {
if(a[x][y]) return 1;
}
return 0;
}
bool zuo(int x,int y) {
for(--y;y>=1;--y) {
if(a[x][y]) return 1;
}
return 0;
}
bool you(int x,int y) {
for(++y;y<=n;++y) {
if(a[x][y]) return 1;
}
return 0;
}
void dfs(int x,int y) {
vis[x][y]=1;
if(a[x][y]==0) {
a[x][y]=1;
ans[++m]='1';
}
if(you(x,y)&&!vis[x][y+1]) {
ans[++m]='R';
dfs(x,y+1);
ans[++m]='L';
}
if(xia(x,y)&&!vis[x+1][y]) {
ans[++m]='D';
dfs(x+1,y);
ans[++m]='U';
}
if(zuo(x,y)&&!vis[x][y-1]) {
ans[++m]='L';
dfs(x,y-1);
ans[++m]='R';
}
if(shang(x,y)&&!vis[x-1][y]) {
ans[++m]='U';
dfs(x-1,y);
ans[++m]='D';
}
ans[++m]='2';
a[x][y]=0;
}
int main() {
int x,y;
while(~scanf("%d%d%d",&n,&x,&y)) {
for(int i=1;i<=n;++i) {
for(int j=1;j<=n;++j) {
scanf("%d",&a[i][j]);
}
}
m=0;memset(vis,0,sizeof(vis));
for(int i=0;i<=n+1;++i) {
vis[0][i]=1;
vis[i][0]=1;
vis[n+1][i]=1;
vis[i][n+1]=1;
}
dfs(x,y);
int flag=1;
for(int i=1;i<=n&&flag;++i) {
for(int j=1;j<=n;++j) {
if(a[i][j]) {
flag=0;
break;
}
}
}
if(flag) {
puts("YES");
for(int i=1;i<=m;++i) printf("%c",ans[i]);puts("");
} else {
puts("NO");
}
}
return 0;
}