## Search found 41 matches

- Sat Aug 14, 2004 12:20 pm
- Forum: Algorithms
- Topic: Index Trees
- Replies:
**2** - Views:
**1304**

### Index Trees

Can someone explain me the Idea of the Index Trees and if possible to give some link to read for this thing , or some problem which is solveable with this structure ? Thank you.

- Fri Aug 13, 2004 9:50 pm
- Forum: Algorithms
- Topic: Need DP Problems
- Replies:
**6** - Views:
**2058**

### Need DP Problems

Hi . I need some interesting dp problems , but all I solved and read in online-judge.uva.es are LCS or LNS , or Matrix Multiplication or other modified standart algorithm :( - and at last I lost interest in solving them . Can you tell me some dp problems not solved by a standart algorithm ? Thank Yo...

- Thu Aug 12, 2004 6:54 pm
- Forum: Algorithms
- Topic: DP Problem
- Replies:
**16** - Views:
**2848**

Hello Again. I said that I thought it had something common with 'Matrix multiplication" , because in the 'matrix multiplication' algorithm the mutliplication is an associative operation. For Example if we have 4 matrixes there are these possibilities of the way of multiplication : (A(B(CD))) (A((BC)...

- Thu Aug 12, 2004 3:35 pm
- Forum: Algorithms
- Topic: DP Problem
- Replies:
**16** - Views:
**2848**

### Thanks

Thank you very much Maniac . I will try to understand your code It is really useful for me !

- Thu Aug 12, 2004 2:15 pm
- Forum: Algorithms
- Topic: DP Problem
- Replies:
**16** - Views:
**2848**

### DP Problem

I want to ask for one interesting DP problem. Here it is : http://acm.uva.es/contest/data/next/problemset/p4.html I have recently met the same problem . I know it is connected with the algorithm " Matrix Multiplication " , but I can`t solve this problem . Please help ! :) I would appreciate some sou...

- Mon Aug 09, 2004 7:55 pm
- Forum: Volume 6 (600-699)
- Topic: 696 - How Many Knights
- Replies:
**29** - Views:
**13375**

### 696

#include <stdio.h> #define max(a,b) (a>b?a:b) int n,m; int main() { int ans; while(scanf("%d%d",&n,&m)==2) { if(n==1 || m==1) ans = max(n,m); else if(n>=3 && m>=3) ans = (n*m + 1)/2; else { int i=0; int f = max(n,m); ans = 0; while(i<=f) { i++; if(i>f) break; ans+=2; i++; if(i>f) break; ans+=2; i++;...

- Sun Aug 08, 2004 5:21 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10596 - Morning Walk
- Replies:
**41** - Views:
**15409**

### 10596 .. why WA ?

#include <stdio.h> #include <string.h> int n,r; int A[201][201]; char isEulerGraph() { int i,j; bool visit = false; for(i=0;i<n;i++) { visit = false; int din = 0,dout = 0; for(j=0;j<n;j++) { if(A [j]){ din++; visit = true; } if(A[j] ){ dout++; visit = true; } } if(!visit) return 0; if(din != dout) r...

- Mon Jul 26, 2004 9:00 pm
- Forum: Algorithms
- Topic: Help With USACO Problem
- Replies:
**13** - Views:
**3366**

### Thanks

Thank you very much yaro

- Mon Jul 26, 2004 12:46 am
- Forum: Algorithms
- Topic: Help With USACO Problem
- Replies:
**13** - Views:
**3366**

### Idea

Is it is possible for someone who passed this USACO problem to post the USACO analysis ? I mean only the analysis of the algorithm , no - source . Thank you

- Mon Jul 05, 2004 6:06 pm
- Forum: Algorithms
- Topic: Help With USACO Problem
- Replies:
**13** - Views:
**3366**

- Sun Jul 04, 2004 1:35 pm
- Forum: Algorithms
- Topic: Help With USACO Problem
- Replies:
**13** - Views:
**3366**

### Help With USACO Problem

Hello . I want to ask you for some idea for one usaco problem. It is called Shaping Regions. It is a Chapter 2 problem. If you can give some idea please do it . Thank you very much . ( I am a newbie in the forum and my english is not so good - sorry ! )